UGC NET PAPER 2 June 2019 Question 61 (Shift-I)

61. Match List-I with List-II:

List-I	List-II
(a) Prims's algorithm	(i)O(V3 logV)
(b) Dijkstra's algorithm	(ii) O(VE2)
(c) Faster all pairs shortest path	(iii) O(ElogV)
(d) Edmonds-karp algorithm	(iv) O(V2)

A (a)-(ii); (b)-(iv); (c)-(i); (d)-(iii)

B (a)-(iii); (b)-(iv); (c)-(i); (d)-(ii)

C (a)-(ii); (b)-(i); (c)-(iv); (d)-(iii)

D (a)-(iii); (b)-(i); (c)-(iv); (d)-(ii)

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 60	UGC NET CS 2018 July - II Question 62