1
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following array of elements.

$$\,\,\,\,\,\,\,\,$$$$〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉$$

The minimum number of interchanges needed to convert it into a max-heap is
A
$$4$$
B
$$5$$
C
$$2$$
D
$$3$$
2
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
An unordered list contains $$n$$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
A
$$\Theta \left( {n\,\,\log \,\,n} \right)$$
B
$$\Theta \left( n \right)$$
C
$$\Theta \left( {\log \,\,n} \right)$$
D
$$\Theta \left( 1 \right)$$
3
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n ( $$ \ge 2$$ ) numbers? In the recurrence equations given in the options below, c is a constant.
A
T(n) = 2T(n/2) + cn
B
T(n) = T(n - 1) + T(1) + cn
C
T(n) = 2T(n - 1) + cn
D
T(n) = T(n/2) + cn
4
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
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:
A
10, 8, 7, 3, 2, 1, 5
B
10, 8, 7, 2, 3, 1, 5
C
10, 8, 7, 1, 2, 3, 5
D
10, 8, 7, 5, 3, 2, 1
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12