Question 7 - Spreading Phenomena

Consider immunization strategies discussed in the context of network epidemics. Which of the following statements is incorrect?

A) Random immunization performs poorly in scale-free networks because it rarely targets highly connected hubs.

B) Targeted immunization raises the epidemic threshold by removing the hubs responsible for rapid spreading.

C) Immunizing a randomly selected neighbor of a randomly chosen individual tends to target high-degree nodes due to the friendship paradox.

D) Random immunization always outperforms targeted immunization in networks where ⟨k²⟩ is finite.

E) None of the above

Original Idea by: Jhonatan Cléto

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Question 1 - BFS

Consider the following statements about detecting cycles using BFS: I. In an undirected graph , a cycle can be detected if BFS discovers an already visited node that is not the parent of the current node. II. In a directed graph , a cycle can be detected during BFS by encountering a node that is currently in the queue (i.e., discovered but not fully processed). III. BFS cannot be used for cycle detection in either directed or undirected graphs. IV. When used to test bipartiteness, BFS indirectly detects cycles of odd length if they exist. V. BFS can always detect cycles in a weighted graph, regardless of whether the weights are positive or negative. Which of the statements are correct ? A) I and II B) I, II and IV C) III and V D) Only IV E) None of the above Original idea by: Jhonatan Cléto
Leia mais

Question 3 - Calculus & Network Flow

In the Ford–Fulkerson method, the bottleneck capacity of an augmenting path is usually defined as the minimum of the residual capacities of its edges. Suppose a path has two edges whose residual capacities vary with time \(t\), \(r_1(t) = t^2 + 1\) and \(r_2(t) = e^t\). Instead of taking the minimum, define the augmenting path capacity as the average of the residuals: \(R(t) = \frac{r_1(t) + r_2(t)}{2}\). What is the derivative \(\frac{dR}{dt}\) at \(t = 1\)? A) 1 B) 2.34 C) 2.72 D) 2.86 E) None of the above Original idea by: Jhonatan Cléto
Leia mais

Question 5 - TSP

Imagem
A drone delivery company must deliver packages to five floating islands in a futuristic archipelago. The islands are named Aqua (A), Bora (B), Coral (C), Drift (D), and Echo (E). Distances (in km) between islands are shown below:  To minimize battery usage, the drone company decides to plan its route using the Christofides algorithm to approximate the optimal Traveling Salesperson path. What is the approximate minimum total distance the drone will travel to visit all islands once and return to the starting point? A) 24 km B) 25 km C) 26 km D) 27 km E) None of the above Original idea by: Jhonatan Cléto
Leia mais