1
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Match the pairs in the following:
(b) Kruskal's minimum spanning tree algorithm
(c) Bioconnected components algorithm
(d) Floyd's shortest path algorithm
(q) Dynamic programming
(r) Divide and Conquer
(s) Depth first search
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
GATE CSE Subjects
Browse all chapters by subject
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages