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
Recommended Posts:
- UGC-NET | UGC NET CS 2018 July - II | Question 95
- UGC-NET | UGC-NET CS 2017 Nov - III | Question 11
- UGC-NET | UGC NET CS 2016 Aug - III | Question 2
- UGC-NET | UGC NET CS 2016 Aug - III | Question 3
- UGC-NET | UGC NET CS 2016 Aug - III | Question 4
- UGC-NET | UGC NET CS 2016 Aug - III | Question 5
- UGC-NET | UGC-NET CS 2017 Nov - III | Question 8
- UGC-NET | UGC-NET CS 2017 Nov - III | Question 9
- UGC-NET | UGC-NET CS 2017 Nov - III | Question 10
- UGC-NET | UGC NET CS 2015 Jun - II | Question 28
- UGC-NET | UGC NET CS 2018 July - II | Question 47
- UGC-NET | UGC NET CS 2018 July - II | Question 48
- UGC-NET | UGC NET CS 2018 July - II | Question 49
- UGC-NET | UGC NET CS 2015 Jun - III | Question 17
- UGC-NET | UGC NET CS 2015 Jun - III | Question 16
- UGC-NET | UGC NET CS 2016 July – II | Question 11
- UGC-NET | UGC NET CS 2016 July – II | Question 12
- UGC-NET | UGC NET CS 2018 July - II | Question 55
- UGC-NET | UGC NET CS 2015 Dec – III | Question 20
- UGC-NET | UGC-NET CS 2017 Dec 2 | Question 4
