If we have a very small amount of additional memory , but a large number of items to sort, which of the following sorting algorithm should we use?

A Merge sort
B Heap sort
C Buble sort
D Bogo sort

Correct Answer: Heap sort

Bissoy MCQ
#তথ্য প্রযুক্তি #পিএসসি ও অন্যান্য নিয়োগ পরীক্ষা #বিভিন্ন মন্ত্রণালয় | সহকারী ম্যানটেনেন্স প্রকৌশলী | 24-05-2022

Related Questions

2 large and 1 small pumps can fill a water tank in 4 hours. 1 large and 3 small pumps can also fill the same water tank in 4 hours . How many hours will it take for 3 large 4 small pumps to fill the tank?
A 2 hours
B 2.5 hours
C 3 hours
D 3.5 hours
2 large and 1 small pumps can fill a water tank in 4 hours. One large and 3 small pumps can also fill the same water tank in 4 hours. how many hours will it take for 3 large and 4 small pumps to fill the tank?
A 2 hours
B 2.5 hours
C 3 hours
D 3.5 hours
A form sorting machine can sort 12 forms in 10 minutes. How many forms can it sort in one and half hours at this rate ?
A 150
B 158
C 152
D 108
Randomized quick sort is an extension of quicksort where the pivot is chosen randomly. what is the worst case complexity of sorting a numbers using randomized quick sort?
A O (n)
B O (n2)
C O (n log n)
D O (n!)
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate ?
A Heap sort
B Quick sort
C Insertion sort
D Merge Sort
The solid brick shown is made of small square shaped bricks of side 1. when the large brick is disassembled into its component small bricks. the total surface area of all the small bricks is how much greater than the surface area of the large brick?
A 32
B 40
C 60
D 72
In a certain fashion house, which has four sizes of a specific shirt, there is one-third as many small shirts as medium shirts, and 1/2 as many large shirts as small shirts. If there are as many X-large shirts as large shirts, what percent of the shirts in the store are medium?
A 30%
B 40%
C 50%
D 60%
Assume you would like to sort an array in ascending order by value while preserving key associations. Which of the following PHP sorting functions would you use?
A ksort()
B asort()
C krsort()
D sort()
E usort()
The most suitable filter for the removal of very small amount of precipitate from very large volumes of water is the __________ filter.
A Vacuum
B Sand
C Plate & frame
D Rotary
Bubble sort algorithm sorts n data items using
A O(n2) comparison
B O (nn)comparison
C O (n long n) comparison
D O (n) comparison

Next steps