Consider the following table: Algorithms Design Paradigms (P) Kruskal (i) Divide and Conquer (Q) Quicksort (ii) Greedy (R) Floyd-Warshall (iii) Dynamic Programming Match the algorithms to the design paradigms they are based on.

Correct Answer is : (P) ↔ (ii), (Q) ↔ (i), (R) ↔ (iii)

(P) ↔ (ii), (Q) ↔ (iii), (R) ↔ (i)

(P) ↔ (iii), (Q) ↔ (i), (R) ↔ (ii)

(P) ↔ (ii), (Q) ↔ (i), (R) ↔ (iii)

(P) ↔ (i), (Q) ↔ (ii), (R) ↔ (iii)

GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 15 of 65

Marks: +1, -0

Consider the following table:

Match the algorithms to the design paradigms they are based on.

Go to Question:

Prev Question

Next Question