Skip to content
GATETECH
Official PYQ · 2025Set 2 · Q7Routing Protocols: Shortest Path, Flooding, Distance Vector, Link StateMCQ1 mark

GATE CS 2025 Set 2 Q7 — Routing Protocols: Shortest Path, Flooding, Distance Vector, Link State

Explain with AI

Consider the routing protocols given in List I and the names given in List II:
List IList II(i)Distance Vector routing(a)Bellman-Ford(ii)Link state routing(b)Dijkstra\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?

 

Choose one option
View worked solution

Answer: A

To find the correct match between the routing protocols in List I and the algorithms in List II:

  • (i) Distance Vector Routing: This class of routing protocols (such as RIP) relies on the Bellman-Ford algorithm. Each router maintains a distance vector (a list of distances to all destination networks) and periodically shares this vector with its immediate neighbors to iteratively compute the shortest paths. Thus, (i) matches with (a).
  • (ii) Link State Routing: This class of routing protocols (such as OSPF) requires each router to have complete knowledge of the entire network topology. Each router independently runs Dijkstra's algorithm on its local link-state database to compute the shortest path tree to all other nodes. Thus, (ii) matches with (b).

Therefore, the correct matching is (i) - (a) and (ii) - (b), which corresponds to Option A.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Routing Protocols: Shortest Path, Flooding, Distance Vector, Link State questions