1
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\}$$
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 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)$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the process of inserting an element into a Max Heap, where the Max Heap is represented by an array. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of comparisons performed is:
A
$$\Theta(\log_2n)$$
B
$$\Theta(\log_2\log_2n)$$
C
$$\Theta(n)$$
D
$$\Theta(n\log_2n)$$
GATE CSE Subjects
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12