MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the output of the following code? |
| A. | 62 |
| B. | 69 |
| C. | 75 |
| D. | 88View Answer |
| Answer» E. | |
| 2. |
What is the value stored in t2[3] when the following code is executed? |
| A. | 19 |
| B. | 23 |
| C. | 25 |
| D. | 27View Answer |
| Answer» D. 27View Answer | |
| 3. |
What is the value stored in t1[2] when the following code is executed? |
| A. | 16 |
| B. | 18 |
| C. | 20 |
| D. | 22View Answer |
| Answer» D. 22View Answer | |
| 4. |
Consider the following code: Which of the following lines should be inserted to complete the above code? |
| A. | t2[i] = get_min(t2[i-1]+spent[1][i], t1[i-1]+reach[0][i-1]+spent[1][i]) |
| B. | t2[i] = get_min(t2[i-1]+spent[1][i], t1[i-1]+spent[1][i]) |
| C. | t2[i] = get_min(t2[i-1]+spent[1][i], t1[i-1]+reach[0][i-1]) |
| D. | none of the mentionedView Answer |
| Answer» B. t2[i] = get_min(t2[i-1]+spent[1][i], t1[i-1]+spent[1][i]) | |
| 5. |
Consider the following assembly line problem: What is the minimum time required to build the car chassis? |
| A. | 40 |
| B. | 41 |
| C. | 42 |
| D. | 43View Answer |
| Answer» E. | |
| 6. |
Consider the following assembly line problem: For the optimal solution, which should be the exit assembly line? |
| A. | Line 1 |
| B. | Line 2 |
| C. | All of the mentioned |
| D. | None of the mentionedView Answer |
| Answer» C. All of the mentioned | |
| 7. |
Consider the following assembly line problem: For the optimal solution which should be the starting assembly line? |
| A. | Line 1 |
| B. | Line 2 |
| C. | All of the mentioned |
| D. | None of the mentionedView Answer |
| Answer» C. All of the mentioned | |
| 8. |
What is the space complexity of the above dynamic programming implementation of the assembly line scheduling problem? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(n<sup>3</sup>) |
| Answer» E. | |
| 9. |
What_is_the_time_complexity_of_the_above_dynamic_programming_implementation_of_the_assembly_line_scheduling_problem? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(n<sup>3</sup>) |
| Answer» D. O(n<sup>3</sup>) | |
| 10. |
In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 11. |
What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(2<sup>n</sup>) |
| Answer» E. | |
| 12. |
Which of the following methods can be used to solve the assembly line scheduling problem? |
| A. | Recursion |
| B. | Brute force |
| C. | Dynamic programming |
| D. | All of the mentioned |
| Answer» E. | |