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
3.4k
0
Do you find this helpful?
15

View all MCQs in

Computer Networks

Discussion

No comments yet