NTA UGC NET Aug 2024 Paper-2
March 22, 2025NTA UGC NET Aug 2024 Paper-2
March 22, 2025NTA UGC NET Aug 2024 Paper-2
| Question 8 |
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-ford 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 :
| (A)-(II),(B)-(I),(C)-(III),(D)-(IV) | |
| (A)-(II),(B)-(I),(C)-(IV),(D)-(III) | |
| (A)-(I),(B)-(II),(C)-(III),(D)-(IV)
| |
| (A)-(III),(B)-(II),(C)-(IV),(D)-(I) |
Correct Answer: B