MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Sleep Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Sleep sort is an in-place sorting technique. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
Which of the following sorting algorithm is most closely related to the OS? |
| A. | gnome sort |
| B. | sleep sort |
| C. | radix sort |
| D. | bogo sort |
| Answer» C. radix sort | |
| 3. |
Sleep sort does gives a correct output when ___________ |
| A. | any input element is negative |
| B. | input array is reverse sorted |
| C. | any input element is positive |
| D. | when there is a very small number to the left of very large number |
| Answer» D. when there is a very small number to the left of very large number | |
| 4. |
Auxiliary space requirement of sleep sort is ___________ |
| A. | O(n) |
| B. | O(1) |
| C. | O(max(input)) |
| D. | O(log n) |
| Answer» C. O(max(input)) | |
| 5. |
Sleep sort can be preferred over which of the following sorting algorithms for large number of input elements? |
| A. | Quick sort |
| B. | Bubble sort |
| C. | Selection sort |
| D. | No sorting algorithm is preferred |
| Answer» E. | |
| 6. |
Time complexity of sleep sort can be approximated to be ___________ |
| A. | O(n + max(input)) |
| B. | O(n<sup>2</sup>) |
| C. | O(n log n + max(input)) |
| D. | O(n log n) |
| Answer» D. O(n log n) | |
| 7. |
Sleep sort code cannot compile online because ___________ |
| A. | it has very high time complexity |
| B. | it has very high space complexity |
| C. | it requires multithreading process |
| D. | online compilers are not efficient |
| Answer» D. online compilers are not efficient | |
| 8. |
Sleep sort works by ___________ |
| A. | making elements to sleep for a time that is proportional to their magnitude |
| B. | making elements to sleep for a time that is inversely proportional to their magnitude |
| C. | partitioning the input array |
| D. | dividing the value of input elements |
| Answer» B. making elements to sleep for a time that is inversely proportional to their magnitude | |
| 9. |
In how many comparisons does the array arr={1,4,2,3,5} gets sorted if we use sleep sort? |
| A. | 5 |
| B. | 3 |
| C. | 1 |
| D. | 0 |
| Answer» E. | |
| 10. |
Sleep sort does not work for ___________ |
| A. | negative numbers |
| B. | large numbers |
| C. | small numbers |
| D. | positive numbers |
| Answer» B. large numbers | |
| 11. |
Which of the following header file is a must to implement sleep sort algorithm? |
| A. | string.h |
| B. | math.hw |
| C. | bios.h |
| D. | windows.h |
| Answer» E. | |