1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Suppose we want to arrange the n numbers stored in any array such that all
negative values occur before all positive ones. Minimum number of exchanges
required in the worst case is
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of articulation points of the following graph is
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Give the correct matching for the following pairs:
Group - 1
(A) $${\rm O}(\log n)$$(B) $${\rm O}(n)$$
(C) $${\rm O}(n\log n)$$
(D) $${\rm O}({n^2})$$
Group - 2
(P) Selection(Q) Insertion sort
(R) Binary search
(S) Merge sort
4
GATE CSE 1997
MCQ (Single Correct Answer)
+1
-0.3
The correct matching for the following pairs is
A. All pairs shortest path | 1. Greedy |
B. Quick Sort | 2. Depth-First Search |
C. Minimum weight spanning tree | 3. Dynamic Programming |
D. Connected Components | 4. Divide and Conquer |
Questions Asked from Searching and Sorting (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2019 (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 2014 Set 2 (1)
GATE CSE 2011 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (2)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2004 (1)
GATE CSE 2003 (1)
GATE CSE 2001 (1)
GATE CSE 1999 (2)
GATE CSE 1998 (1)
GATE CSE 1997 (1)
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