GATEverse — GATE CSE previous year questions

Given below are some algorithms, and some algorithm design paradigms.

\begin{array}{|ll|ll|}\hline \text{1.} & \text{Dijkstra's Shortest Path} & \text{i.} & \text{Divide and Conquer} \\\hline \text{2.} & \text{Floyd-Warshall algorithm to compute} \\& \text{all pair shortest path} & \text{ii.}& \text{Dynamic Programming} \\\hline \text{3.}& \text{Binary search on a sorted array} & \text{iii.} & \text{Greedy design} \\\hline \text{4.} & \text{Backtracking search on a graph} &\text{iv.} & \text{Depth-first search} \\\hline & &\text{v.} & \text{Breadth-first search} \\\hline \end{array}

Match the above algorithms on the left to the corresponding design paradigm they follow.