Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
Match List-I with List-II:
|
List-I |
List-II |
|
(a) Prim’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) |
1
(a)-(ii); (b)-(iv); (c)-(i); (d)-(iii)
2
(a)-(iii); (b)-(iv); (c)-(i); (d)-(ii)
3
(a)-(ii); (b)-(i); (c)-(iv); (d)-(iii)
4
(a)-(iii); (b)-(i) (c)-(iv); (d)-(ii)