GATE | GATE CS 1997 | Question 5

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

Codes:
     A    B    C    D 
a    2    4    1    3
b    3    4    1    2
c    3    4    2    1
d    4    1    2    3

(A) a
(B) b
(C) c
(D) d


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save