UGC-NET | UGC NET CS 2017 Jan – II | Question 30

In link state routing algorithm after construction of link state packets, new routes are computed using:
(A) DES algorithm
(B) Dijkstra’s algorithm
(C) RSA algorithm
(D) Packets


Answer: (B)

Explanation: Refer:Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm
Option (B) is correct.

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.