Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Match the following:
P) Prim’s algorithm for minimum spanning tree (i) Backtracking
Q) Floyd-Warshall algorithm for all pairs shortest paths (ii) Greedy method
R) Mergesort (iii) Dynamic programming
S) Hamiltonian circuit (iv) Divide and conquer
1
P – iii, Q – ii, R – iv, S – i
2
P – i, Q – ii, R – iv, S – iii
3
P – ii, Q – iii, R – iv, S – i
4
P – ii, Q – i, R – iii, S – iv