MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the minimum possible time complexity to find the number of steps to reach the end of an array? |
| A. | O(n) |
| B. | O(n2) |
| C. | O(n3/2) |
| D. | O(1) |
| Answer» B. O(n2) | |
| 2. |
: It is not possible to reach the end of an array if starting element of the array is 0. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 3. |
What will be the worst case time complexity of the following code? |
| A. | O(n1/2) |
| B. | O(n) |
| C. | O(n3/2) |
| D. | O(n2)View Answer |
| Answer» E. | |
| 4. |
In how many different ways we can reach the end of the array arr[]={1,3,5,8,9}? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 5. |
It is not possible to find the minimum number of steps to reach the end of an array in linear time. |
| A. | true |
| B. | false |
| Answer» C. | |
| 6. |
What will be the minimum number of jumps required to reach the end of the array arr[] = {1,2,0,0,3,6,8,5}? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | not possible to reach the end |
| Answer» E. | |
| 7. |
What will be the minimum number of jumps required to reach the end of the array arr[] ={0,1,3,6,3,6,8,5}? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | not possible to reach the end |
| Answer» E. | |
| 8. |
What will be the minimum number of jumps required to reach the end of the array arr[] = {1,3,6,3,6,8,5}? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | not possible to reach the end |
| Answer» D. not possible to reach the end | |