GCSE · Computer Science · AQA · Spec 8525

Decomposition

Nobody writes a whole game in one go. The trick: stop asking 'where do I start?', ask 'what jobs does this need doing?', and give each job its own piece.

Computer Science · Decomposition

Break down a quiz game

The whole problem: make a quiz game. It has been broken into four smaller problems — sub-problems — and each one has a job. Pick a small task, then put it under the sub-problem whose job it helps to do.

Still to sort

Ask a question (0)

Its job: put a question in front of the player and collect their answer.

Mark the answer (0)

Its job: decide whether the player's answer is right.

Update the score (0)

Its job: keep an accurate count of right answers.

Where the line is: Marking makes the decision. Updating the score records it. Two different jobs, so two different sub-problems.

Show the result (0)

Its job: tell the player how they did at the end.

Where the line is: Asking a question and showing the result both use the screen. Asking gets an answer from the player; showing the result reports how the game went.

8 of 8 still to sort.

This is one sensible way to break the quiz game down, not the only one. What makes it work is that every column does one job you can name.

Predict, then check

Here is an earlier attempt at breaking down the same quiz game.

The earlier attempt split the quiz game into just three sub-problems: 'Ask a question', 'Deal with the answer' and 'Show the result'. Which one is still too big to count as one identifiable task?

Check your thinking

What does decomposition actually mean?

Three students were asked to say what decomposition means.

Which answer is closest to what you think right now?
How sure are you?

Your turn

Explain it on a new problem

A cinema wants a program for its ticket machine. Explain what is meant by decomposition, using the ticket machine program as your example. [4 marks]

0 words · your answer stays on this page and is not sent anywhere.

WHAT YOU'VE LEARNED

A quick recap of today's lesson.

Big problems get solved in pieces — and a piece that's still too big gets broken up again.

What you need to know

  • Decomposition means breaking a problem into a number of sub-problems.
  • Each sub-problem accomplishes an identifiable task: you can say what its one job is.
  • A sub-problem might itself be broken down further into smaller sub-problems.

The big picture

Decomposition means breaking a problem into a number of sub-problems, so that each sub-problem does an identifiable task: a job you can name. If a sub-problem is still too big, it can be broken down again into smaller sub-problems, so a decomposition can have parts inside parts. It is about the parts a problem needs, not the order in which things happen.

Key points

1Start by asking 'what jobs does this problem need doing?', not 'what do I do first?'.
2A small task belongs with the sub-problem whose job it helps to do, not with tasks that just look alike.
3Keep breaking down until every piece is one job you can name.
4There is no set number of sub-problems, and an example breakdown is one sensible way, not the only one.

Worked example

Problem

Break down this problem: a program for a number-guessing game. The computer picks a secret number, and the player keeps guessing, getting a clue after each wrong guess, until they get it right.

⚠ Watch out

Writing a list of steps in the order they happen and calling it a decomposition. Decomposition breaks a problem into parts — sub-problems that each do a job — and any part can be broken down again.

🧠

Memory hook

Parts, not steps — and parts can have parts.

✓

Check yourself

Pick an app you use, such as a music player. Without looking back, name three sub-problems it could be broken into and the job each one does. Then break one of them down again.

Flashcards

(5)
What is decomposition?
Breaking a problem into a number of sub-problems, each of which accomplishes an identifiable task.
What does it mean for a sub-problem to have an identifiable task?
You can say what its one job is, in a few words.
A sub-problem is still too big to solve in one go. What do you do?
Break it down again into smaller sub-problems of its own. A decomposition can have parts inside parts.
Is a list of steps in the order they happen a decomposition?
No. Decomposition breaks a problem into parts that each do a job. It is not about the order things happen in.
Two tasks both put something on the screen. Must they go in the same sub-problem?
No. A task goes with the sub-problem whose job it helps to do, not with tasks that use the same action.

Tap any card to flip it, or use Study as deck to go through them one at a time. In the full lesson these run as a spaced-repetition deck — you rate each card Hard, Good or Easy and the tricky ones keep coming back until they stick.

Learning with Lightbulb is opening soon

You can use this lesson now. Join the waitlist and we'll let you know when the full Lightbulb experience is ready.

Keep me posted

More AQA GCSE Computer Science topics

See the full AQA Computer Science curriculum →

How this lesson was checked. This AQA GCSE Computer Science (specification 8525)lesson was published through Lightbulb Learning's human-designed editorial process — the educational standards, accuracy rules and publication checks it must pass were authored and approved by Philip Halpin. It passed subject-specific assessment, automated educational checks and technical publication verification before going live (publication checks completed 28 September 2026). Published pages are monitored, human spot-checking is ongoing across the lesson library, and anything found wrong is corrected or withdrawn. How our lessons are made and checked. Spotted a mistake? Email hello@lightbulblearning.co and we'll review it.