Computer Sciences > Gate 2017 Set-1 > Algorithms
Consider the following table
Match the algorithm to design paradigms they are based on:
| Algorithms | Design Paradigms |
|---|---|
| (P) Kruskal | (i) Divide and Conquer |
| (Q) Quicksort | (ii) Greedy |
| (R) Floyed Warshall | (iii) Dynamic Programming |
Match the algorithm to design paradigms they are based on:
Correct : Algorithms
Similar Questions
Match the following
(P) Prim’s algorithm for minimum spanning tree
(i) Backtracking
(Q) Floyd-Warshall algorithm fo...
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......