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

array-representation

GATE CSE & IT · Data Structures · 1994-2026

14
PYQs
93%
keyed
1
elite explanations
8
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 →
2026 PYQ

Let $n$ be an odd number greater than 100 . Consider a binary minheap with $n$ elements stored in an array $P$ whose index starts from 1. Which of the following indices of $P$ do/d...

mediumanswer keyelite explanation
2023 PYQ

Which one of the following sequences when stored in an array at locations $$A[1],....,A[10]$$ forms a max-heap?

easyanswer keybasic explanation
2022 PYQ

Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the a...

mediumbasic explanation
2015 PYQ

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 insert...

easyanswer key
2009 PYQ

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

easyanswer key
2009 PYQ

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?

mediumanswer key
2006 PYQ

A 3-ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3-ary heap can be represented by an array as follows: The root is stored in the firs...

mediumanswer key
2006 PYQ

A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. the root is stored at X[1]. For a node stored at X[i], the left child, if any...

mediumanswer key
2006 PYQ

An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. If the root node is at level 0, the level of element X...

easyanswer key
2006 PYQ

A 3-ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3-ary heap can be represented by an array as follows: The root is stored in the firs...

mediumanswer key
2006 PYQ

Which of the following sequences of array elements forms a heap?

easyanswer key
2006 PYQ

An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. The index of the parent of element X[i],i≠0 is?

easyanswer key
2001 PYQ

Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array $$\...

easyanswer key
1994 PYQ

In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size n $$\times$$ n, non-zero elements (i.e...

easyanswer keybasic explanation