1
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sorting algorithms has the lowest worst-case complexity?
2
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
In a binary max heap containing n numbers, the smallest element can be found
in time
3
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following in place sorting algorithms needs the minimum
number of swaps?
4
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
An element in an array X is called a leader if it is greater than all elements to the
right of it in X. The best algorithm to find all leaders in an array
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 2019 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 1 (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