Timsort MCQ

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

• What is the usual size of a run in tim sort?
  ক

  32

  খ

  less than 32

  গ

  32-64 depending on size of the array

  ঘ

  64
• In which case will tim sort will work as an insertion sort?
  ক

  when no. of elements are less than 64

  খ

  when no. of elements are greater than 64

  গ

  when no. of elements are less than size of run

  ঘ

  when no. of elements are less than 32
• Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for Tim sort implementation?
  ক

  Because insertion sort is faster and adaptive

  খ

  Because insertion sort requires less space

  গ

  Because insertion sort is easy to implement

  ঘ

  Because insertion sort is easy to understand
• Which of the following algorithm is implemented internally in java when we use function arrays.sort()?
  ক

  intro sort

  খ

  quick sort

  গ

  tim sort

  ঘ

  merge sort
• What is the auxiliary space requirement of Tim sort?
  ক

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

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

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

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

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

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

  O(n)

  খ

  O(n log n)

  গ

  O(n2)

  ঘ

  O(log n)
• Tim sort is a comparison based sort.
  ক

  true

  খ

  false
• Which of the following sorting algorithm is not in-place?
  ক

  insertion sort

  খ

  tim sort

  গ

  quick sort

  ঘ

  intro sort
• Tim sort begins sorting the given array by using which of the following sorting algorithm?
  ক

  selection sort

  খ

  quick sort

  গ

  insertion sort

  ঘ

  merge sort
• Which of the following sorting algorithm is a constituent of tim sort?
  ক

  selection sort

  খ

  quick sort

  গ

  merge sort

  ঘ

  heap sort
• Which of the following is Python’s standard sorting algorithm?
  ক

  quick sort

  খ

  introsort

  গ

  merge sort

  ঘ

  tim sort