Quicksort using Random Sampling MCQ

Test your knowledge with important Quicksort using Random Sampling MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Quicksort using Random Sampling MCQs at Bissoy

• What is the worst case time complexity of randomized quicksort?
  ক

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

  O(n2 log n)
• Which of the following is incorrect about randomized quicksort?
  ক

  it has the same time complexity as standard quick sort

  খ

  it has the same space complexity as standard quick sort

  গ

  it is an in-place sorting algorithm

  ঘ

  it cannot have a time complexity of O(n2) in any case.
• What is the best case time complexity randomized quick sort?
  ক

  O(log n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

  O(n2 log n)
• Randomized quick sort is a stable sort.
  ক

  true

  খ

  false
• Randomized quick sort is an in place sort.
  ক

  true

  খ

  false
• What is the average time complexity of randomized quick sort?
  ক

  O(n log n)

  খ

  O(n2)

  গ

  O(n2 log n)

  ঘ

  O(n log n2)
• What is the auxiliary space complexity of randomized quick sort?
  ক

  O(1)

  খ

  O(n)

  গ

  O(log n)

  ঘ

  O(n log n)
• What is the purpose of using randomized quick sort over standard quick sort?
  ক

  so as to avoid worst case time complexity

  খ

  so as to avoid worst case space complexity

  গ

  to improve accuracy of output

  ঘ

  to improve average case time complexity
• What is a randomized quick sort?
  ক

  quick sort with random partitions

  খ

  quick sort with random choice of pivot

  গ

  quick sort with random output

  ঘ

  quick sort with random input
• Quick sort uses which of the following algorithm to implement sorting?
  ক

  backtracking

  খ

  greedy algorithm

  গ

  divide and conquer

  ঘ

  dynamic programming