1.

Consider the following list1. All pair shortest path A. Greedy2. Quick sort B. BFS3. MST C. Dynamic programming4. Connected components D. Divide and conquerWhich is the correct match.

A. 1-A, 2-B, C-3, D-4
B. 1-D, 2-C, 3-B, 4-A
C. 1-C, 2-D, 3-A, 4-B
D. none of these
Answer» D. none of these


Discussion

No Comment Found