Computational Thinking
Master Computational Thinking for GCSE Computer Science with this free worksheet and full mark scheme — Foundation and Higher exam-style questions with worked answers for AQA GCSE Computer Science (8525). Computational thinking solves problems using abstraction, decomposition and algorithmic thinking.
Free downloads
These worksheets and mark schemes are original, written for Virtus Academy and checked against the current AQA specification. Every worksheet comes with a full mark scheme.
Topic overview
Computational thinking is the approach used to analyse a problem so that a computer can solve it. Three techniques must be known by name.
Abstraction means removing unnecessary detail so only the information relevant to solving the problem remains. Decomposition means breaking a large problem down into smaller, more manageable sub-problems. Algorithmic thinking means identifying the steps needed to reach a solution, in the right order.
The three work together. You decompose a problem into parts, abstract away the irrelevant detail in each part, then design an algorithm for each. A question asking you to apply computational thinking usually wants you to name the technique and then show it being used on the specific problem given.
Revision notes
The three techniques
Abstraction: removing unnecessary detail to focus on what matters.
Decomposition: breaking a problem into smaller sub-problems. Algorithmic thinking: identifying the ordered steps needed to reach a solution.
How they work together
Decompose the problem into parts, then abstract each part, then design an algorithm for each.
A large program is built this way — the overall task is split into subroutines, each handling one clearly defined piece.
Applying them in exams
Questions usually give a scenario and ask you to apply a technique to it.
Name the technique, then show it in use on the specific problem. Saying 'use abstraction' without saying which details would be removed earns nothing.
Key points
- Computational thinking analyses problems for computers.
- Abstraction removes unnecessary detail.
- Decomposition breaks a problem into sub-problems.
- Algorithmic thinking identifies the ordered steps.
- The three techniques work together.
- Apply techniques to the specific problem given.
Worked examples
Example 1
Name the three techniques used in computational thinking. [3 marks]
Working
Example 2
A programmer is designing a satnav. State one detail that abstraction would remove and one that it would keep. [2 marks]
Working
Example 3
Explain how decomposition helps when writing a large program. [2 marks]
Working
Common mistakes
Confusing abstraction with decomposition.
Abstraction removes detail; decomposition splits the problem into parts.
Naming a technique without applying it.
Questions want the technique used on the specific scenario given.
Saying abstraction removes important detail.
It removes only detail that is not relevant to solving the problem.
Giving only two techniques.
All three are named in the specification.
Exam tips
- Learn all three technique names precisely.
- Apply the technique to the scenario, do not just name it.
- Say unnecessary detail when defining abstraction.
- Use sub-problems when defining decomposition.
Key terms
- Computational thinking
- Analysing a problem so a computer can solve it.
- Abstraction
- Removing unnecessary detail from a problem.
- Decomposition
- Breaking a problem into smaller sub-problems.
- Algorithmic thinking
- Identifying the ordered steps to a solution.
Related topics
Written and reviewed against the current AQA specification. Spotted an error? Let us know.