Consider the following statements regarding routing:
I – Distance vector routing uses Dijkstra\’s algorithm while link state routing uses Bellman-Ford algorithm for making routing table.
II – There is a count to infinity problem in distance vector routing but link state routing is free from count to infinity problem.
III – Open Shortest Path First (OSPF) is a unicast routing protocol.
IV – Routing Information Protocol (RIP) is a Static routing protocol which uses hop count as a routing metric to find the best path between the source and the destination network.
Which of the following is/are correct?
(A) II, III and IV
(B) III only
(C) II and III
(D) I and IV


Answer: (C)

Explanation: I – Distance vector routing uses the Bellman-Ford algorithm while link state routing uses Dijkstra\’s algorithm for making routing table.
IV – Routing Information Protocol (RIP) is a dynamic routing protocol which uses hop count as a routing metric to find the best path between the source and the destination network.

Quiz of this Question