Heap Sort Multiple Choice MCQ

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

• How many elements can be sorted in O(logn) time using Heap sort?
  ক

  O(1)

  খ

  O(n/2)

  গ

  O(logn/log(logn))

  ঘ

  O(logn)
• Introsort algorithm is combination of _____________
  ক

  Quick sort and Heap sort

  খ

  Quick sort and Shell sort

  গ

  Heap sort and Merge sort

  ঘ

  Heap sort and insertion sort
• Which one of the following is a variation of Heap sort?
  ক

  Comb sort

  খ

  Smooth sort

  গ

  Binary tree sort

  ঘ

  Shell sort
• In average case Heap sort is as efficient as the Quick sort.
  ক

  True

  খ

  False
• What is its wort case time complexity of Heap sort?
  ক

  O(nlogn)

  খ

  O(n2logn)

  গ

  O(n2)

  ঘ

  O(n3)
• The descending heap property is ___________ = A b) A <= A c) A >= A d) A > 2 * A
  ক

  A = A

  খ

  Parent(i)

  গ

  Parent(i)

  ঘ

  Parent(i)
• The essential part of Heap sort is construction of max-heap. Consider the tree shown below, the node 24 violates the max-heap property. Once heapify procedure is applied to it, which position will it be in?
  ক

  4

  খ

  5

  গ

  8

  ঘ

  9
• Which one of the following is false?
  ক

  Heap sort is an in-place algorithm

  খ

  Heap sort has O(nlogn) average case time complexity

  গ

  Heap sort is stable sort

  ঘ

  Heap sort is a comparison-based sorting algorithm
• Heap sort is an implementation of ____________ using a descending priority queue.
  ক

  insertion sort

  খ

  selection sort

  গ

  bubble sort

  ঘ

  merge sort
• What is the average number of comparisons used to heap sort a random permutation of N distinct items?
  ক

  2N log N-O(N)

  খ

  2N log N-O(N log N)

  গ

  2N log N-O(N log log N)

  ঘ

  2N log N-O(log N)
• What is the time taken to copy elements to and from two arrays created for deletion?
  ক

  O(N)

  খ

  O(N log N)

  গ

  O(log N)

  ঘ

  O(N2)
• What is the average number of comparisons used in a heap sort algorithm?
  ক

  N log N-O(N)

  খ

  O(N log N)-O(N)

  গ

  O(N log N)-1

  ঘ

  2N log N + O(N)
• Heap sort is an extremely stable algorithm.
  ক

  true

  খ

  false
• What is the time taken to perform a delete min operation?
  ক

  O(N)

  খ

  O(N log N)

  গ

  O(log N)

  ঘ

  O(N2)
• How many arrays are required to perform deletion operation in a heap?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  4
• What is the typical running time of a heap sort algorithm?
  ক

  O(N)

  খ

  O(N log N)

  গ

  O(log N)

  ঘ

  O(N2)
• In what position does the array for heap sort contains data?
  ক

  0

  খ

  1

  গ

  -1

  ঘ

  anywhere in the array
• Consider the following heap after buildheap phase. What will be its corresponding array?
  ক

  26,53,41,97,58,59,31

  খ

  26,31,41,53,58,59,97

  গ

  26,41,53,97,31,58,59

  ঘ

  97,53,59,26,41,58,31
• Heap sort is faster than Shell sort.
  ক

  true

  খ

  false
• In what time can a binary heap be built?
  ক

  O(N)

  খ

  O(N log N)

  গ

  O(log N)

  ঘ

  O(N2)
• On which algorithm is heap sort based on?
  ক

  Fibonacci heap

  খ

  Binary tree

  গ

  Priority queue

  ঘ

  FIFO