UGC-NET | NTA UGC NET 2019 June – II | Question 35

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)


Answer: (B)

Explanation: Prims algorithm: (E log V)

Dijkstra’s algorithm: (V^2)

Floyd’s warshal all- shortest path algorithm: (V^3 log V)

Edmonds Karp algorithm: (VE^2)

Quiz of this Question

My Personal Notes arrow_drop_up

Save