Computer Sciences > GATE 2025 SET-2 > Routing Algorithms
Consider the routing protocols given in List I and the names given in List II:
List I
(i) Distance vector routing
(ii) Link state routing
List II
(a) Bellman-Ford
(b) Dijkstra
For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
List I
(i) Distance vector routing
(ii) Link state routing
List II
(a) Bellman-Ford
(b) Dijkstra
For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
Correct : a
Correct answer:
a) (i)-(a) and (ii)-(b)
- Distance vector routing (i) uses the Bellman-Ford algorithm (a).
- Link state routing (ii) uses the Dijkstra algorithm (b).
Total Unique Visitors
Loading......