Computer Sciences > Gate 2017 Set-1 > Algorithms
Consider the following table

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:
A
P-(ii), Q-(iii), R-(i)
B
P-(iii), Q-(i), R-(ii)
C
P-(ii), Q-(i), R-(iii)
D
P-(i), Q-(ii), R-(iii)

Correct : Algorithms

Similar Questions

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...
#989 MSQ
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...
#989 MSQ
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...
#989 MSQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......