Q.

The computation of the shortest path in OSPF is usually done by                          

A. bellman-ford algorithm
B. routing information protocol
C. dijkstra’s algorithm
D. distance vector routing
Answer» 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.
4.1k
0
Do you find this helpful?
21

View all MCQs in

Computer Architecture and Organization

Discussion

No comments yet

Related MCQs