Home Previous Year GATE CSE

Menu

Home Previous Year

GATE CSE

All subjects Operating Systems132 DBMS122 Computer Networks142 Algorithms128 Programming & Data Structures195 Theory of Computation122 Compiler Design95 Computer Organization & Architecture131 Digital Logic91 Discrete Mathematics133 Engineering Mathematics139 General Aptitude260

Coming soon

BookmarksSoon

My progressSoon

PYQ Hub · Previous year questions, organised for practice.Every question lists its source.

Heaps (Programming & Data Structures): GATE CSE PYQs | PYQ Hub

Operating Systems132

Computer Networks142

Programming & Data Structures195

Theory of Computation122

Compiler Design95

Computer Organization & Architecture131

Digital Logic91

Discrete Mathematics133

Engineering Mathematics139

General Aptitude260

Home
Previous Year
GATE
CSE
Programming & Data Structures
Heaps

GATE CSE previous year questions · Programming & Data Structures

Heaps

19 questions

Filters & sort1

Sort

FiltersClear all

Year

2026 2025 2024 2023 2022 2021 2020 2019

1

GATE CSE 2021 | Set 2 | Question 2

MCQ1 mark

Let

H

be a binary min-heap consisting of

n

elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in

H

?

Single correct

Answer key coming soon

Source: GATE CSE 2021 Set 2 (CS2), IIT Bombay. Official question paper.

2

GATE CSE 2016 | Set 2 | Question 34

NAT2 marks

A complete binary min-heap is made by including each integer in

[1, 1023]

exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is ________.

Numerical answer

Your answer

Answer key coming soon

Source: GATE CSE 2016 Set 2, IISc Bengaluru. Official question paper.

3

GATE CSE 2015 | Set 2 | Question 22

MCQ1 mark

Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

Single correct

Source: GATE CSE 2015 Set 2, IIT Kanpur. Official question paper and answer key.

4

GATE CSE 2014 | Set 2 | Question 12

MCQ1 mark

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:

Single correct

Source: GATE CSE 2014 Set 2, IIT Kharagpur. Official question paper and answer key.

Use ← → to move

Questions

4 total

Correct Wrong Answer seen

Sort

FiltersClear all

Year

2026 2025 2024 2023 2022 2021 2020 2019

Set

Set 1 Set 2 Set 3

Set

Set 1 Set 2 Set 3

Marks

Marks

Question type

Question type