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 functions Function 1 and Function 2 expressed in pseudocode as follows:
Let f1(n) and f2(n) denote the number of times the statement "x = x + 1" is...
Consider the following functions, where n is a positive integer.n1/3, log(n), log(n!), 2log(n)Which one of the following options lists the functions in increasi...
Total Unique Visitors
Loading......