Data Structures

1: The correct matching for the following pairs is   (A) All pairs shortest path (B) Quick sort (C) Minimum weight spanning tree (D) Connected Components   (1) Greedy (2) Depth-first search (3) Dynamic programming (4) Divide and conquer    
A.

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

B.

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

C.

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

D.

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

 

Answer : B

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.