GATE Computer Science (CS) 2015 Shift 1 Solved Paper

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