![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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. |
View all MCQs in
Computer Architecture and OrganizationNo comments yet