GATEverse
← GATE CSE 2017 Set 1

Q05

MCQ1 mark, −0.33

Consider the following table:

AlgorithmsDesign Paradigms(P)Kruskal(i)Divide and Conquer(Q)Quicksort(ii)Greedy(R)Floyd-Warshall(iii)Dynamic Programming\begin{array}{|ll|ll|}\hline & \textbf{Algorithms} & & \textbf{Design Paradigms} \\\hline \text{(P)} & \text{Kruskal} & \text{(i)}& \text{Divide and Conquer} \\\hline \text{(Q)}& \text{Quicksort} & \text{(ii)} & \text{Greedy} \\\hline \text{(R)} & \text{Floyd-Warshall} &\text{(iii)} & \text{Dynamic Programming} \\\hline \end{array}

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

Sign in to save attempts.

Loading…