Quick Sort Multiple Choice MCQ

Test your knowledge with important Quick Sort Multiple Choice MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Quick Sort Multiple Choice MCQs at Bissoy

• Quick sort is a space-optimised version of ____
  ক

  Bubble sort

  খ

  Selection sort

  গ

  Insertion sort

  ঘ

  Binary tree sort
• Which one of the following sorting algorithm is best suited to sort an array of 1 million elements?
  ক

  Bubble sort

  খ

  Insertion sort

  গ

  Merge sort

  ঘ

  Quick sort
• A machine needs a minimum of 200 sec to sort 1000 elements by Quick sort. The minimum time needed to sort 200 elements will be approximately __________
  ক

  60.2 sec

  খ

  45.54 sec

  গ

  31.11 sec

  ঘ

  20 sec
• 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?
  ক

  22 25 56 67 89

  খ

  52 25 76 67 89

  গ

  22 25 76 67 50

  ঘ

  52 25 89 67 76
• 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)<=?
  ক

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

  খ

  T(n) <= T(n/4) + T(3n/4) + cn

  গ

  T(n) <= 2 T(3n/4) + cn

  ঘ

  T(n) <= T(n/3) + T(3n/4) + cn
• Quick sort is a stable sorting algorithm.
  ক

  True

  খ

  False
• The best case behaviour occurs for quick sort is, if partition splits the array of size n into __________
  ক

  n/2 : (n/2) – 1

  খ

  n/2 : n/3

  গ

  n/4 : 3n/2

  ঘ

  n/4 : 3n/4
• Apply Quick sort on a given sequence 7 11 14 6 9 4 3 12. What is the sequence after first phase, pivot is first element?
  ক

  6 4 3 7 11 9 14 12

  খ

  6 3 4 7 9 14 11 12

  গ

  7 6 14 11 9 4 3 12

  ঘ

  7 6 4 3 9 14 11 12
• What is the worst case time complexity of the Quick sort?
  ক

  O(nlogn)

  খ

  O(n)

  গ

  O(n3)

  ঘ

  O(n2)
• Quick Sort is a __________
  ক

  greedy algorithm

  খ

  divide and conquer algorithm

  গ

  dynamic programming algorithm

  ঘ

  backtracking algorithm
• Which among the following is the best cut-off range to perform insertion sort within a quick sort?
  ক

  N=0-5

  খ

  N=5-20

  গ

  N=20-30

  ঘ

  N>30
• Which is the worst method of choosing a pivot element?
  ক

  first element as pivot

  খ

  last element as pivot

  গ

  median-of-three partitioning

  ঘ

  random element as pivot
• How many sub arrays does the quick sort algorithm divide the entire array into?
  ক

  one

  খ

  two

  গ

  three

  ঘ

  four
• Quick sort uses join operation rather than merge operation.
  ক

  true

  খ

  false
• Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
  ক

  Merge sort

  খ

  Shell sort

  গ

  Insertion sort

  ঘ

  Bubble sort
• What is the average running time of a quick sort algorithm?
  ক

  O(N2)

  খ

  O(N)

  গ

  O(N log N)

  ঘ

  O(log N)
• Which is the safest method to choose a pivot element?
  ক

  choosing a random element as pivot

  খ

  choosing the first element as pivot

  গ

  choosing the last element as pivot

  ঘ

  median-of-three partitioning method
• Find the pivot element from the given input using median-of-three partitioning method. 8, 1, 4, 9, 6, 3, 5, 2, 7, 0.
  ক

  8

  খ

  7

  গ

  9

  ঘ

  6
• Which of the following methods is the most effective for picking the pivot element?
  ক

  first element

  খ

  last element

  গ

  median-of-three partitioning

  ঘ

  random element
• What is the worst case time complexity of a quick sort algorithm?
  ক

  O(N)

  খ

  O(N log N)

  গ

  O(N2)

  ঘ

  O(log N)
• Quick sort follows Divide-and-Conquer strategy.
  ক

  True

  খ

  False