MCQs City stays free thanks to ads. Please turn off your ad blocker for this site so content and features keep working.
Computer Networks
Online Test
Q
In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a ________
AA. Graph
BB. Tree
CC. Network
DD. Link
Correct Answer:
A. 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.