1
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Match the pairs in the following:

List - I

(a) Straseen's matrix multiplication algorithm
(b) Kruskal's minimum spanning tree algorithm
(c) Bioconnected components algorithm
(d) Floyd's shortest path algorithm

List - II

(p) Greedy method
(q) Dynamic programming
(r) Divide and Conquer
(s) Depth first search
A
a - r, b - p, c - s, d - q
B
a - r, b - p, c - q, d - s
C
a - r, b - s, c - p, d - q
D
a - q, b - p, c - s, d - r

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies