Question 1
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) – (ii); (b)-(iv); (c)-(i); (d)-(iii)
(a) – (iii); (b)-(iv); (c)-(i); (d)-(ii)
(a) – (ii); (b)-(i); (c)-(iv); (d)-(iii)
(a) – (iii); (b)-(i); (c)-(iv); (d)-(ii)
There are 1 questions to complete.