1.

In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a ________(a) Graph(b) Tree(c) Network(d) LinkThe question was posed to me in semester exam.Origin of the question is Packet Forwarding and Routing in section Networking of Computer Network

Answer»

Right answer is (a) Graph

To elaborate: 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.



Discussion

No Comment Found

Related InterviewSolutions