GATE CSE 2015 Set 2 | Searching and Sorting Question 10 | Algorithms

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-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

$$\Theta \left( {n\,\,\log \,\,n} \right)$$

$$\Theta \left( n \right)$$

$$\Theta \left( {\log \,\,n} \right)$$

$$\Theta \left( 1 \right)$$

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

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

T(n) = 2T(n/2) + cn

T(n) = T(n - 1) + T(1) + cn

T(n) = 2T(n - 1) + cn

T(n) = T(n/2) + cn

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-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:

10, 8, 7, 3, 2, 1, 5

10, 8, 7, 2, 3, 1, 5

10, 8, 7, 1, 2, 3, 5

10, 8, 7, 5, 3, 2, 1

GATE CSE 2011

MCQ (Single Correct Answer)

-0.3

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?