1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?
$$\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\,$$ Quicksort runs in $$\Theta \left( {{n^2}} \right)$$ time
$$\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Bubblesort runs in $$\Theta \left( {{n^2}} \right)$$ time
$$\,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Mergesort runs in $$\Theta \left( n \right)$$ time
$$\,\,\,{\rm I}V.\,\,\,\,\,\,\,$$ Insertion sort runs in $$\Theta \left( n \right)$$ time
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
3
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n ( $$ \ge 2$$ ) numbers? In the recurrence equations given in the options below, c is a constant.
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
An unordered list contains $$n$$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
Questions Asked from Searching and Sorting (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2019 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 3 (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
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude