InterviewSolution
Saved Bookmarks
| 1. |
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 routingThis question was addressed to me during an interview.I'd like to ask this question from OSPF topic in section Network Layer of Computer Network |
|
Answer» The correct choice is (c) Dijkstra’s algorithm |
|