Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Dynamic Programming
Match List I with List II
|
List I |
List II |
|
(A) Topological sort of DAG |
(I) O(V + E) |
|
(B) Kruskal's MST algorithm |
(II) O(VE) |
|
(C) Bellman-Ford's single-source shortest path algorithm |
(III) θ (V + E) |
|
(D) Floyd-Warshall's all-pair shortest path algorithm |
(IV) θ(V3) |
Choose the correct answer from the options given below:
1
A - I, B - III, C - IV, D - II
2
A - III, B - I, C - IV, D - II
3
A - III, B - I, C - II, D - IV
4
A - I, B - III, C - II, D - IV