Computer Sciences > Gate 2015 Set-1 > Algorithms
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 |
Correct : Algorithms
Similar Questions
Consider the following table
Algorithms
Design Paradigms
(P) Kruskal
(i) Divide and Conquer...
Consider the following table
Algorithms
Design Paradigms
(P) Kruskal
(i) Divide and Conquer...
Consider the following table
Algorithms
Design Paradigms
(P) Kruskal
(i) Divide and Conquer...
Total Unique Visitors
Loading......