MCQs City stays free thanks to ads. Please turn off your ad blocker for this site so content and features keep working.
Computer Networks
Ospf
Q
The computation of the shortest path in OSPF is usually done by ____________
AA. Bellman-ford algorithm
BB. Routing information protocol
CC. Dijkstra’s algorithm
DD. Distance vector routing
Correct Answer:
C. C. Dijkstra’s algorithm
Explanation:
Shortest path in OSPF is usually computed by Dijkstra’s algorithm. It was proposed by Edsger W. Dijkstra in the year 1956. It is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast.
