ExamSIDE
Questions (Powered by ExamGOAL)
Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
Previous Next
1
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?
A
Quick sort
B
Insertion sort
C
Selection sort
D
Heap sort
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
A
$$O(n)$$
B
$$O(\log n)$$
C
$$O(\log \log n)$$
D
$$O(1)$$
3
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of
A
$$n$$
B
$${n^2}$$
C
$$n\log n$$
D
$$n{\log ^2}n$$
4
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time
A
$$\Theta (n \log n)$$
B
$$\Theta (n)$$
C
$$\Theta(\log n)$$
D
$$\Theta(1)$$
Previous Next
Questions Asked from Marks 1
GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2021 Set 1 (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
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization