Skip to content
Related Articles
Open in App
Not now

Related Articles

GATE | GATE CS 1997 | Question 5

Improve Article
Save Article
Like Article
  • Last Updated : 16 Oct, 2017
Improve Article
Save Article
Like Article

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
     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)


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

My Personal Notes arrow_drop_up
Like Article
Save Article
Related Articles

Start Your Coding Journey Now!