1
GATE CSE 2021 Set 1
+2
-0.67

Consider the following array.

 23 32 45 69 72 73 89 97

Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort above array in ascending order?
A
Insertion sort
B
Selection sort
C
Quicksort using the last element as pivot
D
Merge sort
2
GATE CSE 2018
Numerical
+2
-0
The number of possible min-heaps containing each value from $$\left\{ {1,2,3,4,5,6,7} \right\}$$ exactly once is _____.
3
GATE CSE 2016 Set 2
Numerical
+2
-0
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 ___________.
4
GATE CSE 2016 Set 1
+2
-0.6
An operator $$delete(i)$$ for a binary heap data structure is to be designed to delete the item in the $$i$$-th node. Assume that the heap is implemented in an array and i refers to the $$i$$-th index of the array. If the heap tree has depth $$d$$ (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element?
A
$$O\left( 1 \right)$$
B
$$O\left( d \right)$$ but not $$O\left( 1 \right)$$
C
$$O\left( {{2^d}} \right)$$ but not $$O\left( d \right)$$
D
$$O\left( {d{2^d}} \right)$$ but not $$O\left( {{2^d}} \right)$$
GATE CSE Subjects
EXAM MAP
Medical
NEET