📚 Topic Summary
Problem decomposition is a fancy way of saying 'breaking down a big problem into smaller, easier problems'. Imagine you need to clean your entire room. That sounds like a lot of work! But if you break it down into smaller tasks, like making your bed, picking up toys, and putting clothes away, it becomes much more manageable. Each small task is easier to solve, and when you finish all the small tasks, you've solved the big problem!
In computer science, we use problem decomposition to write programs. We break down what the program needs to do into smaller steps, making it easier to code and understand.
🧠 Part A: Vocabulary
Match the term with its definition.
| Term |
Definition |
| 1. Algorithm |
A. Breaking a big problem into smaller parts |
| 2. Decomposition |
B. A step-by-step set of instructions |
| 3. Problem |
C. A specific task or obstacle to overcome |
| 4. Solution |
D. A plan to fix a problem |
| 5. Step |
E. An individual instruction within an algorithm |
✍️ Part B: Fill in the Blanks
Use the words below to fill in the blanks in the paragraph.
Words: smaller, problem, easier, decomposition, solve
Problem __________ is when we break down a big __________ into __________ parts. This makes the problem __________ to __________.
💡 Part C: Critical Thinking
Think about planning a birthday party. How would you use problem decomposition to make the planning process easier? Give at least three sub-tasks you would identify.