Problem Decomposition Quiz for AP Computer Science

📚 Quick Study Guide

• ➗ Definition: Problem decomposition is breaking down a complex problem into smaller, more manageable subproblems.
• 🧠 Benefits: Makes complex problems easier to understand, solve, and test. Improves code reusability and maintainability.
• 🔨 Approach: Identify the main tasks, then break each task into smaller subtasks. Continue until the subtasks are simple enough to implement directly.
• 💻 Top-Down Design: A common strategy where you start with the overall problem and progressively refine it into smaller parts.
• 📝 Abstraction: Focus on what each subproblem does, not how it does it, at each level of decomposition.
• 🧪 Testing: Test each subproblem independently to ensure it works correctly before integrating it into the larger solution.
• 💡 Example: Designing a program to calculate student grades can be decomposed into inputting student data, calculating averages, assigning letter grades, and outputting results.

🤔 Practice Quiz

1. Which of the following best describes problem decomposition?
   1. Breaking a problem into smaller, more manageable parts.
   2. Writing code without comments.
   3. Combining multiple programs into one.
   4. Ignoring error handling to save time.
2. What is a primary benefit of using problem decomposition in programming?
   1. It makes the code run faster.
   2. It simplifies complex problems and improves code organization.
   3. It reduces the need for testing.
   4. It eliminates the need for comments.
3. In problem decomposition, what does "abstraction" refer to?
   1. Focusing on the specific implementation details of each subproblem.
   2. Ignoring the complexity of each subproblem.
   3. Focusing on what each subproblem does, without concerning how it does it.
   4. Combining multiple subproblems into one large problem.
4. Which programming paradigm is most closely associated with problem decomposition?
   1. Object-oriented programming.
   2. Functional programming.
   3. Imperative programming.
   4. Structured programming.
5. What is a potential drawback of poor problem decomposition?
   1. It can lead to simpler, more understandable code.
   2. It can result in more reusable code.
   3. It can make the overall problem harder to solve and understand.
   4. It has no potential drawbacks.
6. When should you stop decomposing a problem into subproblems?
   1. When the subproblems are still too complex to solve directly.
   2. When the subproblems are simple enough to implement directly.
   3. When you run out of time.
   4. When you have created more than five subproblems.
7. Which of the following is NOT a typical step in problem decomposition?
   1. Identifying the main tasks.
   2. Breaking tasks into smaller subtasks.
   3. Writing detailed comments for each line of code.
   4. Testing each subproblem independently.