GATEverse
← GATE CSE 1997

Q1.5

MCQMarks unknown

The correct matching for the following pairs is

A.All pairs shortest path1.GreedyB.Quick Sort2.Depth-First SearchC.Minimum weight spanning tree3.Dynamic ProgrammingD.Connected Components4.Divide and Conquer\begin{array}{|ll|ll|}\hline \text{A.} & \text{All pairs shortest path} & \text{1.} & \text{Greedy} \\\hline \text{B.} & \text{Quick Sort} & \text{2.}& \text{Depth-First Search} \\\hline \text{C.}& \text{Minimum weight spanning tree} & \text{3.} & \text{Dynamic Programming} \\\hline \text{D.} & \text{Connected Components} &\text{4.} & \text{Divide and Conquer} \\\hline \end{array}
Sign in to save attempts.

Loading…