GATE CS 2025 Set 2 Q.17: Routing Algorithms (Distance Vector, Link State) and BGP/OSPF

Consider the routing protocols given in List I and the names given in List II:

List I	List II
(i) Distance vector routing	(a) Bellman-Ford
(ii) Link state routing	(b) Dijkstra

For matching of items in List I with those in List II, which ONE of the following options is CORRECT?

(i) - (a) and (ii) - (b)

(i) - (a) and (ii) - (a)

(i) - (b) and (ii) - (a)

(i) - (b) and (ii) - (b)

Official answer and solution

Solution

Match Distance Vector routing with the distributed Bellman-Ford equation and Link State routing with Dijkstra's shortest-path algorithm.

Distance vector routing (i) (e.g., RIP) computes shortest paths iteratively using the distributed Bellman-Ford equation (a).
Link state routing (ii) (e.g., OSPF) floods link-state advertisements so each router builds the complete topology and runs Dijkstra's shortest-path algorithm (b).

Final answer

Option (A)

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Paper: GATE 2025 Computer Science and Information Technology - Session 2 (CS2)
Question: 17 of 65
Section: Computer Science and Information Technology

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.