1.1 Decomposition, Abstraction & Algorithmic Thinking — Edexcel 1CP2

What is Computational Thinking?

Computational thinking is a set of problem-solving techniques that help break down complex problems so they can be solved using a computer or by following a logical process. The Edexcel 1CP2 specification focuses on three core techniques: decomposition, abstraction, and algorithmic thinking.

Decomposition

Decomposition means breaking a large, complex problem down into smaller, more manageable sub-problems. Each sub-problem can then be solved individually, and the solutions combined to solve the original problem.

Example: Developing a school management system could be decomposed into: student records module, timetabling module, attendance tracking module, and exam results module. Each module is manageable on its own.

Decomposition is especially useful when working in a team, as different people can solve different sub-problems independently.

Exam tip: When asked to describe decomposition, always give a specific example. Just saying "break the problem into smaller parts" alone will typically not score the second mark — you need to name the sub-problems.

Abstraction

Abstraction means removing unnecessary detail from a problem, keeping only the information that is relevant to solving it. It allows programmers to focus on what matters and ignore what does not.

Examples of abstraction:

A map is an abstraction of the real world — it shows roads and landmarks but removes irrelevant detail like building colours or tree species
A weather app shows temperature and rain probability, not air pressure or humidity
A programmer uses variable names like studentName instead of a raw memory address
Calling a function without needing to know how it works internally

Exam tip: Abstraction removes unnecessary detail — not all detail. This distinction matters in exam answers. A map still shows roads; it just hides irrelevant information.

Algorithmic Thinking

Algorithmic thinking means developing a set of precise, logical, step-by-step instructions that can be followed to solve a problem. A good algorithm:

Has a clear starting point and ending point
Uses unambiguous, precise steps
Always terminates (it must stop)
Produces the correct output for any valid input

Algorithmic thinking is the foundation of all programming. Once you have designed an algorithm, you can implement it in any programming language.

How the Three Techniques Work Together

Technique	What it involves	Why it helps
Decomposition	Splitting a big problem into smaller sub-problems	Makes large problems manageable; allows teamwork
Abstraction	Removing irrelevant detail	Lets you focus on what matters; reduces complexity
Algorithmic thinking	Creating step-by-step instructions	Produces a precise solution that can be coded

In practice: decompose the problem into parts → abstract away unnecessary detail from each part → write an algorithm for each part → combine into a full solution.

⚠️ Common Mistakes

Confusing decomposition (splitting a problem) with abstraction (removing detail) — they are different techniques
Saying abstraction removes "all" detail — it only removes unnecessary detail
Not giving a specific example when a question says "with an example"
Writing vague algorithms — exam mark schemes require unambiguous, ordered steps
Saying decomposition means "making the problem smaller" without explaining splitting into sub-problems

✅ Notes completed — well done!

▶

Video uploading to YouTube shortly

Check back soon — this lesson video is in production

Key points covered in this video

What computational thinking is and why it matters
Decomposition — breaking problems into sub-problems with examples
Abstraction — removing unnecessary detail with worked examples
Algorithmic thinking — properties of a good algorithm
How all three techniques work together to solve real problems
Edexcel exam question styles for Topic 1.1

Slides for this lesson will be available when the video is ready.

Click slide or press arrow keys to navigate

✍️

Exam-style Worksheet — 1.1 Decomposition, Abstraction & Algorithmic Thinking

8 Edexcel 1CP2-style questions · 20 marks total · instantly marked using Edexcel criteria

Q1What is meant by "decomposition" in computational thinking?[1 mark]

✅ Mark scheme

Mark scheme answer

Breaking a complex/large problem down into smaller, more manageable sub-problems. [1 mark]

Q2State what is meant by "abstraction".[1 mark]

✅ Mark scheme

Mark scheme answer

Removing unnecessary detail from a problem, keeping only information relevant to the solution. [1 mark]

Q3Give one difference between decomposition and abstraction.[2 marks]

✅ Mark scheme

Mark scheme answer

Decomposition splits a problem into smaller sub-problems [1]; abstraction removes unnecessary detail from those problems/focuses on relevant information [1].

Q4State two properties that a well-designed algorithm must have.[2 marks]

✅ Mark scheme

Mark scheme answer (any 2)

• Has a clear start and end point [1]
• Uses unambiguous, precise steps [1]
• Always terminates [1]
• Produces the correct output for any valid input [1]

Q5A team is developing an online shopping system. Describe how decomposition could be applied, giving at least two sub-problems.[3 marks]

✅ Mark scheme

Mark scheme answer

The system would be broken into sub-problems [1] such as: user login/account management [1], product catalogue/search [1], shopping basket [1], payment processing [1], order tracking [1]. Award 1 mark for identifying the process + 1 mark per relevant named sub-problem, max 3 total.

Q6Explain how abstraction is used when a programmer creates a function that calculates the area of a shape. In your answer, refer to what detail is hidden and why this is useful.[3 marks]

✅ Mark scheme

Mark scheme answer

The internal implementation/formula for calculating the area is hidden [1]; the programmer using the function only needs to know the inputs (e.g. length, width) and what it returns [1]; this is useful because it reduces complexity / other parts of the program do not need to know how the calculation works [1].

Q7Explain what is meant by algorithmic thinking. Describe the stages you would follow to apply algorithmic thinking to solve the problem: "Find the highest-scoring student in a class."[4 marks]

✅ Mark scheme

Mark scheme answer

Algorithmic thinking means developing precise, step-by-step logical instructions to solve a problem [1].
Example stages: Set a variable to store the highest score and start at 0 [1]; loop through each student's score [1]; if a score is higher than the current highest, update the highest score and record the student's name [1]; after the loop, output the stored name and highest score [1]. Award 1 for definition + up to 3 for valid logical steps.

Q8A map of a city is an example of abstraction. Explain what detail has been removed and why this makes it a useful tool. Then give one other example of abstraction used in computing.[4 marks]

✅ Mark scheme

Mark scheme answer

A map removes detail such as building colours, tree species, exact building heights [1]; this makes it easier to navigate as only relevant information (roads, place names) is shown [1].
Other computing examples: using variable names instead of memory addresses [1]; calling a function without knowing its internal code [1]; an operating system hiding hardware complexity from the user [1]. Award 1 mark per valid point, max 4 total.

—

out of 20 marks

Topic Quiz

Question 1 of 15

You scored

out of 15

Card 1 of 8

Click to reveal definition

🎉

Session complete!

Term	Definition

🔒

Unlock Everything

This content is part of the full CSZone subscription. Your first lesson of every section is free — subscribe to unlock all 59 Edexcel 1CP2 lessons.

£7.99/month

or £59/year — best value

Subscribe now →

What is Computational Thinking?

Decomposition

Abstraction

Algorithmic Thinking

How the Three Techniques Work Together

Key points covered in this video

Exam-style Worksheet — 1.1 Decomposition, Abstraction & Algorithmic Thinking

Mini Test — 1.1 Computational Thinking