1
GATE CSE 2019
Numerical
+1
-0.33
An array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed in the worst possible location in the first round of partitioning (rounded off to 2 decimal places) is ______.
2
GATE CSE 2016 Set 2
+1
-0.3
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?

$$\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\,$$ Quicksort runs in $$\Theta \left( {{n^2}} \right)$$ time
$$\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Bubblesort runs in $$\Theta \left( {{n^2}} \right)$$ time
$$\,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Mergesort runs in $$\Theta \left( n \right)$$ time
$$\,\,\,{\rm I}V.\,\,\,\,\,\,\,$$ Insertion sort runs in $$\Theta \left( n \right)$$ time

A
$${\rm I}$$ and $${\rm II}$$ only
B
$${\rm I}$$ and $${\rm III}$$ only
C
$${\rm II}$$ and $${\rm IV}$$ only
D
$${\rm I}$$ and $${\rm IV}$$ only
3
GATE CSE 2016 Set 1
+1
-0.3
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
A
$$\Theta \left( {n\,\log n} \right),\Theta \left( {n\,\log n} \right),\,\,$$ and $$\,\,\Theta \left( {{n^2}} \right)$$
B
$$\Theta \left( {{n^2}} \right),\Theta \left( {{n^2}} \right),\,\,$$ and $$\,\,\Theta \left( {n\,\log n} \right)$$
C
$$\Theta \left( {{n^2}} \right),\,\,\Theta \left( {n\,\log n} \right),\,\,$$ and $$\,\,\Theta \left( {n\,\log n} \right)$$
D
$$\Theta \left( {{n^2}} \right),\Theta \left( {n\,\log n} \right),\,\,$$ and $$\,\,\Theta \left( {{n^2}} \right)$$
4
GATE CSE 2015 Set 3
+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$$
GATE CSE Subjects
EXAM MAP
Medical
NEET