Consider the following table: P. Kruskal i. Divide and Conquer Q. Quicksort…

GATE · 2017 · CS · Set 1 · Computer Science & IT

Consider the following table:

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.

  1. A.

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

  2. B.

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

  3. C.

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

  4. D.

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

Attempted by 594 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…