engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Match List - I with List - II
|
LIST I Algorithms |
LIST II Complexity |
||
|
A. |
Bellman - Ford algorithm (with adjacency list representation) |
I. |
O (|V|2) |
|
B. |
Dijkstra Algorithm |
II. |
O((V + E)log V) |
|
C. |
Prim's Algorithm |
III. |
O(nm) |
|
D. |
Topological sorting (with adjacency list representation) |
IV. |
O(n + m) |
Choose the correct answer from the options given below:
1
(A) - (III), (B) - (I), (C) - (II), (D) - (IV)
2
(A) - (II), (B) - (IV), (C) - (III), (D) - (I)
3
(A) - (III), (B) - (IV), (C) - (I), (D) - (II)
4
(A) - (II), (B) - (I), (C) - (III), (D) - (IV)