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 |
View all MCQs in
Computer NetworksNo comments yet