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 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4.
Array Index 1 2 3 4 5 6 7 8 9
Value 40 30 20 10 15 16 17 8 4

Now consider that a value 35 is inserted into this heap. After insertion, the new heap is

A
40, 30, 20, 10, 15, 16, 17, 8, 4, 35
B
40, 35, 20, 10, 30, 16, 17, 8, 4, 15
C
40, 30, 20, 10, 35, 16, 17, 8, 4, 15
D
40, 35, 20, 10, 15, 16, 17, 8, 4, 30
2
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider a binary max-heap implemented using an array. What is the content of the array {25, 14, 16, 13, 10, 8, 12} after two delete operations?
A
{14, 13, 12, 10, 8}
B
{14, 12, 13, 8, 10}
C
{14, 13, 8, 12, 10}
D
{14, 13, 12, 8 10}
3
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?
A
$$\left\{25,12,16,13,10,8,14\right\}$$
B
$$\left\{25,14,13,16,10,8,12\right\}$$
C
$$\left\{25,14,16,13,10,8,12\right\}$$
D
$$\left\{25,14,12,13,10,8,16\right\}$$
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is
A
$$\Theta(\log n)$$
B
$$\Theta(n)$$
C
$$\Theta(n\log n)$$
D
$$\Theta(n^2)$$
Previous Next
Questions Asked from Marks 2
GATE CSE 2025 Set 2 (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 2009 (2) GATE CSE 2008 (1) GATE CSE 2007 (1) GATE CSE 2006 (3) GATE CSE 2005 (2) GATE CSE 2004 (1) GATE CSE 1999 (1) GATE CSE 1996 (2) GATE CSE 1994 (1) GATE CSE 1992 (1) GATE CSE 1991 (1) GATE CSE 1990 (2)
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