Top MCQs on HeapSort Algorithm with Answers (original) (raw)

The number of elements that can be sorted in [Tex]\\Theta(logn)[/Tex] time using heap sort is

(A) [Tex]\Theta(1)[/Tex] (B) [Tex]\Theta(\sqrt{logn})[/Tex] (C) [Tex]\Theta(Log n/(Log Log n))[/Tex] (d) [Tex]\Theta(Log n)[/Tex]

Given an unsorted array. The array has this property that every element in the array is at most k distance from its position in a sorted array where k is a positive integer smaller than the size of an array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?

• Insertion Sort with time complexity O(kn)
• Heap Sort with time complexity O(nLogk)
• Quick Sort with time complexity O(kLogk)
• Merge Sort with time complexity O(kLogk)

Which of the following is not true about comparison-based sorting algorithms?

• The minimum possible time complexity of a comparison-based sorting algorithm is O(n(log(n)) for a random input array
• Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
• Counting Sort is not a comparison based sorting algorithm
• Heap Sort is not a comparison based sorting algorithm.

Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?

Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?

Which sorting algorithms is most efficient to sort string consisting of ASCII characters?

Which of the following is true about merge sort?

• Merge Sort works better than quick sort if data is accessed from slow sequential memory.
• Merge Sort is stable sort by nature
• Merge sort outperforms heap sort in most of the practical situations.

Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ?

There are 9 questions to complete.

Take a part in the ongoing discussion