Lesson 3 of 82 in this sequence

Not completed yet

Saved on this device only — not synced to an account yet.

Learning path

Step 3 of 82

Continue the sequence

ResumeReturn to this step ReviewRevisit the core idea RemediateGet repair practice Next stepChoose the next lesson manually

Completion

Review objectives and instruction
Complete the activity with manual learner confirmation
Answer every understanding-check item
Show completion feedback and reward only after the learner finishes the check

Progress

Step 3/82
15 content types
AI help source context available
Auto-advance blocked

Review objectives and instruction

AI help

Available only with source grounding, privacy limits, age controls, and measurement.

AI source context

Breaking Big Problems Down with Decomposition · Decomposition: solving a complex problem by breaking it into smaller subproblems · CSTA 2-AP-13

Evidence: local lesson AI-help metadata only; source-grounding, privacy, age-safety, and measurement hooks do not prove real model quality, production telemetry, child AI approval, or AI tutor production readiness

Production AI readiness not claimed

AI source context

Assessment shape

Local lesson assessment shape is complete.

Local shape only; production answer-attempt telemetry, live ownership/RLS evidence, mastery interpretation, release, and production readiness are not claimed here.

Objectives: 5
Activity: Prompt ready
Quiz items: 4 items, 4 answer keys, 4 explanations
Reward: Completion reward ready

Assessment progress stays manual: do not auto-advance through uncertain answers, failed writes, consent, media, payment, learner choice, or AI-assisted checks.

Learning-loop evidence: Content-map contract only; persistence and production learner-progress writes require route/API evidence.

Manual policy: assessment, media, consent, payment, learner choice, failed writes, and AI-uncertain help stay under learner control.

Prerequisite: Complete or review Bits, Bytes, and Why Files Have Sizes

AI guardrails

Privacy

Do not send raw child free text without consent
Use source excerpts and non-identifying progress state only
Asset is not registry-gated

Age safety

Apply learn audience controls before AI-help claims
Keep child learner AI paths behind guardian/product review evidence before readiness claims

Measurement

Log AI help usage by surface and asset slug
Evaluate answer quality against source-grounded rubric before production-readiness claims
Tie remediation prompts to completion, retry, or review outcomes

Local AI-help guardrails only; they do not prove guardian approval, production telemetry, model evaluation, release, deployment, or AI tutor production readiness.

Source and rights

Source path: koydo-app/scripts/curriculum-authoring
License: ai-generated-koydo
Attribution: Attribution decision needs owner review
AI provenance: claude-opus-4-8

Source review gates: attribution_missing

Local source evidence only; this does not prove publication rights, attribution approval, AI provenance clearance, release, deployment, or production readiness.

Route review

Current route: /library/learn/computer_science/en/lesson/decomposition-and-abstraction
Route source: Fallback route needs owner canonical review
Candidate route: /library/learn/computer_science/en/lesson/decomposition-and-abstraction

Local route evidence only; fallback candidates need owner-approved canonical route policy before route writes, production discoverability, or readiness claims.

Content gates: canonical_target_web_missing_uses_library_fallback

lessonslessonslesson objectivesmedia scenesdrillspractice setsquizzesfeedbackcharacterscitationsconcept mapsprogressresumereviewremediationnext steps

Breaking Big Problems Down with Decomposition

with Byte

Byte the friendly robot stands at a glowing workbench, using both hands to pull apart one giant tangled task card and slot each smaller piece into its own neat labeled box

Define decomposition as splitting one big problem into smaller subproblems
Identify which items are genuine subproblems of a given goal
Break a real task into three or more named subproblems
Explain why decomposition makes large problems easier to solve
Distinguish a real subproblem from a distractor that does not belong to the goal

Key terms

Decomposition: Splitting one big problem into smaller subproblems to solve
Subproblem: A smaller piece of a goal that can be solved on its own
Abstraction: Hiding details that do not matter for the current goal
Distractor: An idea that does not move you toward the stated goal

Keep Only Goal-Serving Pieces

The hardest part of decomposition is not listing steps but judging which steps actually belong. A genuine subproblem moves you measurably closer to finishing the goal; if removing it would not stop you from succeeding, it probably does not belong. For the goal 'walk the dog,' clipping the leash and walking the route are real subproblems, but deciding which leash colour looks nicest is a distractor. Testing each idea against the goal keeps your decomposition focused and trustworthy.

Why Programmers Decompose Daily

Large software is far too big to hold in one mind at once, so teams break a goal like 'build the game' into independent systems such as scoring, graphics, and controls. Each system becomes a subproblem one person can build, test, and fix without understanding every other part. This division also lets several people work in parallel and makes bugs easier to isolate, because a fault usually lives inside one well-defined piece rather than scattered across the whole program.

Worked examples

Decompose the goal pack a school bag

Write the goal at the top: pack a school bag.
List the first real piece: gather today's textbooks.
Add the next piece: add the lunch and water bottle.
Add the final piece: zip the bag and place it by the door.
Check each piece moves toward a packed bag, dropping any unrelated idea.

Answer: Three subproblems: gather books, add lunch and water, zip and place the bag

Spot the distractor for plan a birthday party

List candidate subproblems: send invitations, buy a cake, recall last year's party, set up decorations.
Check each against the goal of holding the party.
Sending invitations, buying a cake, and decorating all directly serve the party.
Recalling last year's party does not move this party forward, so it is a distractor.

Answer: Recalling last year's party is the distractor

Hi, I'm Byte! Big problems can feel impossible — until you decompose them. Decomposition means splitting one huge problem into smaller subproblems you can solve one at a time. Think about 'make a sandwich for lunch.' That sounds vague and big. Decompose it: (1) get bread, (2) add filling, (3) close the sandwich, (4) clean up. Each step is small and doable on its own. Once you solve all the little pieces, the big problem solves itself. Here is the key move: you have to ask, 'What are the actual pieces of this goal?' Not every idea belongs. If someone says 'make a sandwich' and you list 'think about whether you like bread,' that is not a real subproblem — it drifts away from getting the sandwich made. Good decomposition only keeps steps that directly move you toward the goal. Programmers use decomposition every single day. A game has a score system, a graphics system, a controls system — all decomposed from the single goal 'build the game.' Each programmer can work on one piece at a time instead of trying to hold the whole thing in their head. If you ever feel stuck, write the big goal at the top and list only the steps that directly help reach it. That list is your decomposition.

Activity

The goal is 'walk the dog.' Select ALL items below that are real subproblems of this goal.

Practice

List three real subproblems for the goal of cleaning the kitchen.

Decide whether 'wonder if you like math' belongs in decomposing a homework goal.

Common mistakes to avoid

Every action you take is a subproblemOnly actions that directly move you toward the stated goal count as real subproblems.
Decomposition is the same as abstractionDecomposition divides a problem into parts, while abstraction hides details that do not matter.

Check your understanding

What does decomposition mean in computer science?

A student wants to decompose 'clean your bedroom.' Which list shows real decomposition?

Tomas is decomposing 'plan a science fair project.' He adds 'eat breakfast' to his subproblem list. What is wrong with that?

Why do programmers use decomposition when building large apps?

Recap

Decomposition splits one big problem into smaller subproblems solved one at a time. A valid subproblem must directly serve the goal, while distractors are dropped. Programmers rely on it daily so each system can be built and tested separately.

Reflect

What big project of yours would feel easier if you decomposed it first?