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 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
A
10, 8, 7, 3, 2, 1, 5
B
10, 8, 7, 2, 3, 1, 5
C
10, 8, 7, 1, 2, 3, 5
D
10, 8, 7, 5, 3, 2, 1
2
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
A
GATE CSE 2011 Algorithms - Searching and Sorting Question 33 English Option 1
B
GATE CSE 2011 Algorithms - Searching and Sorting Question 33 English Option 2
C
GATE CSE 2011 Algorithms - Searching and Sorting Question 33 English Option 3
D
GATE CSE 2011 Algorithms - Searching and Sorting Question 33 English Option 4
3
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
What is the number of swaps required to sort n elements using selection sort, in the worst case?
A
$$\Theta(n)$$
B
$$\Theta(n \log n)$$
C
$$\Theta(n^2)$$
D
$$\Theta(n^2 \log n)$$
4
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is GATE CSE 2008 Algorithms - Searching and Sorting Question 37 English
A
MNOPQR
B
NQMPOR
C
QMNPRO
D
QMNPOR
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