Q1.5MCQMarks unknownThe 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}A.B.C.D.All pairs shortest pathQuick SortMinimum weight spanning treeConnected Components1.2.3.4.GreedyDepth-First SearchDynamic ProgrammingDivide and Conquer(A)A-2 B-4 C-1 D-3\text{A-2 B-4 C-1 D-3}A-2 B-4 C-1 D-3(B)A-3 B-4 C-1 D-2\text{A-3 B-4 C-1 D-2}A-3 B-4 C-1 D-2(C)A-3 B-4 C-2 D-1\text{A-3 B-4 C-2 D-1}A-3 B-4 C-2 D-1(D)A-4 B-1 C-2 D-3\text{A-4 B-1 C-2 D-3}A-4 B-1 C-2 D-3Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google