Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

maximum element

GATE CSE & IT · Data Structures · 2020-2024

3
PYQs
67%
keyed
0
elite explanations
3
years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2024 PYQ

Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values o...

mediumanswer keybasic explanation
2021 PYQ

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?

easyanswer keybasic explanation
2020 PYQ

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is _______.

mediumbasic explanation