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. |
Dijkstra's Algorithms |
I. |
Find the shortest path between all pairs of vertices in a graph with positive or negative edge weights. |
|
B. |
Floyd-Warshall Algorithms |
II. |
Finds the shortest path in a weighted graph with non-negative edge weights. |
|
C. |
Bellman-frod Algorithms |
III. |
Sorts elements by repeatedly moving them post neighboring elements that are smaller. |
|
D. |
Prim's Algorithms |
IV. |
Determines the strongest connected components in a directed graph. |
Choose the correct answer from the options given below:
1
(A) - (II), (B) - (I), (C) - (III), (D) - (IV)
2
(A) - (II), (B) - (I), (C) - (IV), (D) - (III)
3
(A) - (I), (B) - (II), (C) - (III), (D) - (IV)
4
(A) - (III), (B) - (II), (C) - (IV), (D) - (I)