MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Reversal algorithm and juggling algorithm for array rotation have the same time complexity. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
What is the time complexity of the juggling algorithm to rotate an array? |
| A. | O(1) |
| B. | O(n) |
| C. | O(d) |
| D. | O(n*d) |
| Answer» C. O(d) | |
| 3. |
Which of the following algorithm to rotate an array has the maximum time complexity? |
| A. | rotate elements one by one |
| B. | juggling algorithm |
| C. | reversal algorithm |
| D. | using a temporary array |
| Answer» B. juggling algorithm | |
| 4. |
Predefined function rotate() in C++ is available under which header file? |
| A. | math |
| B. | stdio |
| C. | stdlib |
| D. | algorithm |
| Answer» E. | |
| 5. |
How many arguments are required by the predefined function rotate() in C++? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 6. |
Which of the following is the predefined function for array reversal in C++? |
| A. | rotate() |
| B. | arr_rotate() |
| C. | array_rotate() |
| D. | rot() |
| Answer» B. arr_rotate() | |
| 7. |
What will be the auxiliary space complexity of the code to rotate an array by using the reversal algorithm (d = number of rotations)? |
| A. | O(1) |
| B. | O(n) |
| C. | O(d) |
| D. | O(n*d) |
| Answer» B. O(n) | |
| 8. |
To rotate an array by using the algorithm of rotating its elements one by one is an in place algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 9. |
What will be the resulting array after rotating arr[]={1, 2, 3, 4, 5} by 2? |
| A. | 2, 1, 3, 4, 5 |
| B. | 3, 4, 5, 1, 2 |
| C. | 4, 5, 1, 2, 3 |
| D. | 1, 2, 3, 5, 4 |
| Answer» C. 4, 5, 1, 2, 3 | |