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
Questions Asked from Searching and Sorting (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2018 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2009 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (3)
GATE CSE 2005 (2)
GATE CSE 2004 (1)
GATE CSE 1999 (1)
GATE CSE 1996 (2)
GATE CSE 1994 (1)
GATE CSE 1992 (1)
GATE CSE 1991 (1)
GATE CSE 1990 (2)
GATE CSE Subjects
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