GATE 2025 CS (CS2) – Question 17
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?
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.
More Routing: Distance Vector and Link State Routing questions
- GATE 2023 CS Q25
- GATE 2022 CS Q57
- GATE 2014 CS (CS1) Q33
- GATE 2014 CS (CS2) Q33
- GATE 2017 CS (CS2) Q19
- GATE 2011 CS Q62
All Routing: Distance Vector and Link State Routing questions →