MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 Mcqs, each offering curated multiple-choice questions to sharpen your Shell Sort Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the worst case analysis of Shell sort using Sedgewick s increments? |
| A. | O(N<sup>2</sup>) |
| B. | O(N<sup>3/2</sup>) |
| C. | O(N<sup>4/3</sup>) |
| D. | O(N<sup>5/4</sup>) |
| Answer» D. O(N<sup>5/4</sup>) | |
| 2. |
What is the worst case analysis of shell sort using Shell s increments? |
| A. | O(N) |
| B. | O(N<sup>2</sup>) |
| C. | O(N<sup>1/2</sup>) |
| D. | O(N<sup>3/2</sup>) |
| Answer» C. O(N<sup>1/2</sup>) | |
| 3. |
What is the general form of Shell s increments? |
| A. | 1,2,3, ,n |
| B. | 1,3,7, .,2k-1 |
| C. | 1,3,5,7, .,k-1 |
| D. | 1,5,10,15, , k-1 |
| Answer» C. 1,3,5,7, .,k-1 | |
| 4. |
What is the worst case running time of shell sort using Hibbard s increments? |
| A. | O(N) |
| B. | O(N<sup>2</sup>) |
| C. | O(N<sup>1/2</sup>) |
| D. | O(N<sup>3/2</sup>) |
| Answer» E. | |
| 5. |
On how many increment sequences does the worst case analysis of shell sort depends? |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» D. four | |
| 6. |
Which of the following statements is the basic for loop for a shell sort algorithm? |
| A. | for(increment=N/2;increment>0;increment/=2) |
| B. | for(i=1;i<n;i++) |
| C. | for(i=n/2;i>=0;i- -) |
| D. | for(i=0;i< n;i++;numelements- -) |
| Answer» B. for(i=1;i<n;i++) | |
| 7. |
Given an array of the following elements 81,94,11,96,12,35,17,95,28,58,41,75,15.What will be the sorted order after 5-sort? |
| A. | 11,12,15,17,28,35,41,58,75,81,94,95,96 |
| B. | 28,12,11,35,41,58,17,94,75,81,96,95,15 |
| C. | 35,17,11,28,12,41,75,15,96,58,81,94,95 |
| D. | 12,11,15,17,81,94,85,96,28,35,41,58,75 |
| Answer» D. 12,11,15,17,81,94,85,96,28,35,41,58,75 | |
| 8. |
Why is Shell sort called as a generalization of Insertion sort? |
| A. | Shell sort allows an exchange of far items whereas insertion sort moves elements by one position |
| B. | Improved lower bound analysis |
| C. | Insertion is more efficient than any other algorithms |
| D. | Shell sort performs internal sorting |
| Answer» B. Improved lower bound analysis | |
| 9. |
Which of the following sorting algorithms is closely related to shell sort? |
| A. | Selection sort |
| B. | Merge sort |
| C. | Insertion sort |
| D. | Bucket sort |
| Answer» D. Bucket sort | |
| 10. |
Shell sort uses a sequence called a incrementing sequence to sort the elements. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 11. |
Shell sort algorithm is an example of? |
| A. | External sorting |
| B. | Internal sorting |
| C. | In-place sorting |
| D. | Bottom-up sorting |
| Answer» C. In-place sorting | |
| 12. |
Shell sort algorithm is the first algorithm to break the quadratic time barrier. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 13. |
Who invented the shell sort algorithm? |
| A. | John Von Neumann |
| B. | Donald Shell |
| C. | Tony Hoare |
| D. | Alan Shell |
| Answer» C. Tony Hoare | |
| 14. |
The worst case running time of shell sort, using Shell s increments is? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(log N) |
| D. | O(N<sup>2</sup>) |
| Answer» E. | |
| 15. |
What is the other name for a shell sort algorithm? |
| A. | Diminishing increment sort |
| B. | Diminishing decrement sort |
| C. | Insertion sort |
| D. | Selection sort |
| Answer» B. Diminishing decrement sort | |