The correct matching for the following pairs is (A) All pairs shortest path…

PYQ GATE 1997

The correct matching for the following pairs is 

(A) All pairs shortest path          (1) Greedy

(B) Quick Sort                       (2) Depth-First search

(C) Minimum weight spanning tree     (3) Dynamic Programming

(D) Connected Components             (4) Divide and and Conquer

  1. A.

    (A-2, B-4, C-1, D-3 )

  2. B.

    (A-3,B-4,C-1, D-2 )

  3. C.

    (A-3 ,B-4 ,C-2 ,D-1 )

  4. D.

    (A-4 ,B-1 ,C-2 ,D-3 )

Attempted by 437 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…