Pigeonhole Sort MCQ

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

Which of the following algorithm takes linear time for sorting?

ক
pigeonhole sort

খ
heap sort

গ
comb sort

ঘ
cycle sort
What is the advantage of pigeonhole sort over merge sort?

ক
pigeonhole sort has lesser time complexity when range is comparable to number of input elements

খ
pigeonhole sort has lesser space complexity

গ
counting sort is not a comparison based sorting technique

ঘ
pigeonhole sort is adaptive
Choose the correct statement from the following.

ক
pigeonhole sort is a comparison based sort

খ
any comparison based sorting can be made stable

গ
quick sort is not a comparison based sort

ঘ
any comparison based sort requires at least O(n2) time
The complexity of which of the following sorting algorithms remains to be the same in its best, average and worst case?

ক
quick sort

খ
insertion sort

গ
pigeonhole sort

ঘ
bubble sort
What is the average time complexity of pigeonhole sort (k=range of input)?

ক
O(n)

খ
O(n+k)

গ
O(n2)

ঘ
O(n*k)
Pigeonhole sort is an in place sorting algorithm.

ক
true

খ
false
Pigeonhole sort is a stable sorting algorithm.

ক
true

খ
false
The auxiliary array used in pigeonhole sorting is called ______________

ক
bucket

খ
pigeon

গ
hole

ঘ
pigeonhole
What is the space complexity of pigeonhole sort (k=range of input)?

ক
O(n*k)

খ
O(n)

গ
O(k)

ঘ
O(n+k)
In which of the following case pigeonhole sort is most efficient?

ক
when range of input is less than number of elements

খ
when range of input is more than number of elements

গ
when range of input is comparable to the number of elements

ঘ
when the given array is almost sorted
Which of the following is a non-comparison sort?

ক
heap sort

খ
quick sort

গ
merge sort

ঘ
pigeonhole sort