The GATE Grind

GATE 2025 CS (CS2) – Question 17

Computer Networks · Routing: Distance Vector and Link State Routing · 1 mark · Multiple choice

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

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

  1. (i) – (a) and (ii) – (b)
  2. (i) – (a) and (ii) – (a)
  3. (i) – (b) and (ii) – (a)
  4. (i) – (b) and (ii) – (b)

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) (i) – (a) and (ii) – (b)

Explanation

Distance vector routing uses the Bellman-Ford algorithm, and link state routing uses Dijkstra's shortest path algorithm.