Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Match List 1 with List 2 and choose the correct answer from the code given below:
|
List I (Graph Algorithm) |
List II (Time Complexity) |
|
a) Dijkstra’s algorithm |
i) Θ(E log E) |
|
b) Kruskal’s algorithm |
ii) Θ(V3) |
|
c) Floyd-Warshall algorithm |
iii) Θ(V2) |
|
d) Topological sorting |
iv) Θ(V + E) |
Where V and E are the number of vertices and edges in graph respectively.
1
(a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)
2
(a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)
3
(a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)
4
(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)