McqMate
| Q. |
In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a |
| A. | graph |
| B. | tree |
| C. | network |
| D. | link |
| Answer» A. graph | |
| Explanation: the djikstra’s shortest path algorithm is the fastest among the algorithms for finding the shortest path in a graph. but it is a greedy method based algorithm so it does not guarantee the shortest path every time. | |
View all MCQs in
Computer Architecture and OrganizationNo comments yet