Q.1
Quick sort is a __________
  • a) greedy algorithm
  • b) divide and conquer algorithm
  • c) dynamic programming algorithm
  • d) backtracking algorithm
Q.2
What is the worst case time complexity of the Quick sort?
  • a) O(nlogn)
  • b) O(n)
  • c) O(n3)
  • d) O(n2)
Q.3
Apply Quick sort on a given sequence 76 9 4 3What is the sequence after first phase, pivot is first element?
  • a) 6 4 3 7 11 9 14 12
  • b) 6 3 4 7 9 14 11 12
  • c) 7 6 14 11 9 4 3 12
  • d) 7 6 4 3 9 14 11 12
Q.4
The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________
  • a) n/2 : (n/2) – 1
  • b) n/2 : n/3
  • c) n/4 : 3n/2
  • d) n/4 : 3n/4
Q.5
Quick sort is a stable sorting algorithm.
  • a) True
  • b) False
Q.6
Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?
  • a) T(n) <= 2 T(n/4) + cn
  • b) T(n) <= T(n/4) + T(3n/4) + cn
  • c) T(n) <= 2 T(3n/4) + cn
  • d) T(n) <= T(n/3) + T(3n/4) + cn
Q.7
Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?
  • a) 22 25 56 67 89
  • b) 52 25 76 67 89
  • c) 22 25 76 67 50
  • d) 52 25 89 67 76
Q.8
A machine needs a minimum ofsec to sortelements by Quick sort. The minimum time needed to sortelements will be approximately __________
  • a) 60.2 sec
  • b) 45.54 sec
  • c) 31.11 sec
  • d) 20 sec
Q.9
Which one of the following sorting algorithm is best suited to sort an array of 1 million elements?
  • a) Bubble sort
  • b) Insertion sort
  • c) Merge sort
  • d) Quick sort
Q.10
Quick sort is a space-optimised version of ____
  • a) Bubble sort
  • b) Selection sort
  • c) Insertion sort
  • d) Binary tree sort
0 h : 0 m : 1 s