InterviewSolution
Saved Bookmarks
| 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 |
|