MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 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. |
There is a one line error in the following routine. Find that line. |
| A. | Line 2 |
| B. | Line 4 |
| C. | Line 6 |
| D. | Line 5View Answer |
| Answer» C. Line 6 | |
| 2. |
The Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people? |
| A. | Bill Gates |
| B. | Jacob Goodman |
| C. | Christos Papadimitriou |
| D. | John Goodman |
| Answer» E. | |
| 3. |
When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through __________ |
| A. | Combinations |
| B. | Exponential functions |
| C. | Logarithmic functions |
| D. | Permutations |
| Answer» E. | |
| 4. |
There is one small error in the following flip routine. Find out which line it is on. |
| A. | Line 3 |
| B. | Line 5 |
| C. | Line 7 |
| D. | Line 9View Answer |
| Answer» D. Line 9View Answer | |
| 5. |
What is the time complexity for a given pancake sort given it undergoes “n” flip operations? |
| A. | O(n) |
| B. | O(n2) |
| C. | O(n3) |
| D. | O(2n) |
| Answer» C. O(n3) | |
| 6. |
WHEN_WE_REALIZE_A_SPECIFIC_IMPLEMENTATION_OF_A_PANCAKE_ALGORITHM,_EVERY_MOVE_WHEN_WE_FIND_THE_GREATEST_OF_THE_SIZED_ARRAY_AND_FLIPPING_CAN_BE_MODELED_THROUGH___________?$ |
| A. | Combinations |
| B. | Exponential functions |
| C. | Logarithmic functions |
| D. | Permutations |
| Answer» E. | |
| 7. |
The_Pancake_Problems_(1975,_1979,_1973)_did_NOT_involve_which_of_the_following_people?$ |
| A. | Bill Gates |
| B. | Jacob Goodman |
| C. | Christos Papadimitriou |
| D. | John Goodman |
| Answer» C. Christos Papadimitriou | |
| 8. |
In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean? |
| A. | Non Polynomial time |
| B. | Non-deterministic Probabilistic |
| C. | Non-deterministic Polynomial time |
| D. | Non Probabilistic time |
| Answer» E. | |
| 9. |
In addition to the pancake sorting problem, there is the case of the burnt pancake problem in which we are dealing with pancakes (discs) that are burnt on one side only. In this case it is taken that the burnt side must always end up _______ |
| A. | Faced down |
| B. | Faced up |
| C. | It doesn’t matter |
| D. | Both sides are burnt |
| Answer» D. Both sides are burnt | |
| 10. |
Pancake Sorting appears in which of the following? |
| A. | Frequency Scaling |
| B. | Storage Virtualization |
| C. | Parallel Processing |
| D. | Neural Networking |
| Answer» B. Storage Virtualization | |
| 11. |
How many flips does the simplest of pancake sorting techniques require? |
| A. | 3n‚àí3 flips |
| B. | 2n-4 flips |
| C. | 2n-3 flips |
| D. | 3n-2 flips |
| Answer» D. 3n-2 flips | |
| 12. |
Line 3 |
| A. | Line 5 |
| B. | Line 7 |
| C. | Line 9 |
| Answer» D. | |
| 13. |
Which operation is most essential to the process of pancake sort? |
| A. | Flip the given data |
| B. | Find the largest of given data |
| C. | Finding the least of given data |
| D. | Inserting something into the given data |
| Answer» B. Find the largest of given data | |
| 14. |
What is the time complexity for a given pancake sort given it undergoes “n” flip operations? |
| A. | O(n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>3</sup>) |
| D. | O(2n) |
| Answer» C. O(n<sup>3</sup>) | |