Merge Sort Multiple Choice MCQ

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

• Which of the following sorting algorithm makes use of merge sort?
  ক

  tim sort

  খ

  intro sort

  গ

  bogo sort

  ঘ

  quick sort
• Merge sort is preferred for arrays over linked lists.
  ক

  true

  খ

  false
• Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?
  ক

  Quick sort

  খ

  Insertion sort

  গ

  Selection sort

  ঘ

  Merge sort
• Which of the following is not a stable sorting algorithm?
  ক

  Quick sort

  খ

  Cocktail sort

  গ

  Bubble sort

  ঘ

  Merge sort
• Which of the following is not in place sorting algorithm by default?
  ক

  merge sort

  খ

  quick sort

  গ

  heap sort

  ঘ

  insertion sort
• Choose the incorrect statement about merge sort from the following?
  ক

  it is a comparison based sort

  খ

  it is an adaptive algorithm

  গ

  it is not an in place algorithm

  ঘ

  it is stable algorithm
• Which of the following is not a variant of merge sort?
  ক

  in-place merge sort

  খ

  bottom up merge sort

  গ

  top down merge sort

  ঘ

  linear merge sort
• What will be the best case time complexity of merge sort?
  ক

  O(n log n)

  খ

  O(n2)

  গ

  O(n2 log n)

  ঘ

  O(n log n2)
• What is the worst case time complexity of merge sort?
  ক

  O(n log n)

  খ

  O(n2)

  গ

  O(n2 log n)

  ঘ

  O(n log n2)
• Merge sort can be implemented using O(1) auxiliary space.
  ক

  true

  খ

  false
• What is the auxiliary space complexity of merge sort?
  ক

  O(1)

  খ

  O(log n)

  গ

  O(n)

  ঘ

  O(n log n)
• What is the average case time complexity of merge sort?
  ক

  O(n log n)

  খ

  O(n2)

  গ

  O(n2 log n)

  ঘ

  O(n log n2)
• Merge sort uses which of the following technique to implement sorting?
  ক

  backtracking

  খ

  greedy algorithm

  গ

  divide and conquer

  ঘ

  dynamic programming