Consider the routing protocols given in List I and the names given in List II:…
2025
Consider the routing protocols given in List I and the names given in List II:
\(\begin{array}{|ll|ll|}\hline & \textbf{List I} & & \textbf{List II} \\\hline \text{(i)} & \text{Distance Vector routing} & \text{(a)}& \text{Bellman-Ford} \\\hline \text{(ii)}& \text{Link state routing} & \text{(b)} & \text{Dijkstra} \\\hline \end{array}\)
For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
Answer: A. (i) – (a) and (ii) – (b) — Correct matching: Distance Vector routing → Bellman-Ford; Link State routing → Dijkstra. Why: Distance Vector routing: Each router maintains and periodically…
- A.
(i) – (a) and (ii) – (b)
- B.
(i) – (a) and (ii) – (a)
- C.
(i) – (b) and (ii) – (a)
- D.
(i) – (b) and (ii) – (b)
Attempted by 377 students.
Show answer & explanation
Correct answer: A
Correct matching: Distance Vector routing → Bellman-Ford; Link State routing → Dijkstra.
Why:
Distance Vector routing: Each router maintains and periodically exchanges a vector of distances to destinations with its neighbors and updates distances by iterative relaxation. This behavior corresponds to the Bellman-Ford algorithm.
Link State routing: Each router floods link-state information so every router can build the complete network graph, then computes shortest paths from itself using Dijkstra's algorithm.
Conclusion: Distance Vector pairs with Bellman-Ford and Link State pairs with Dijkstra, so the matching given by Distance Vector → Bellman-Ford and Link State → Dijkstra is correct.
A video solution is available for this question — log in and enroll to watch it.
Explore the full course: Iocl Engineers Officers Grade A Paper 2