Computational Thinking: Decomposition and Abstraction
What Is Computational Thinking?
Computational thinking is a structured way of approaching problems so they can be solved clearly and efficiently. It is not about using a computer — it is about thinking in a way that makes complex problems manageable. Two key techniques are decomposition and abstraction. Together, they form the foundation of everything you will study in GCSE Computer Science.
An algorithm is a sequence of steps that can be followed to complete a task. A computer program is an implementation of an algorithm in a specific programming language. The algorithm is the abstract plan; the program is the working code.
Algorithms: Sequence Matters
The word “sequence” is deliberate. An algorithm is not simply a “set” of instructions — a set has no order. An algorithm’s steps must be followed in the right order to reach the correct result. A recipe is an everyday example: if you add the eggs before the flour, you do not get the same result.
Every algorithm can be expressed in different forms: as pseudo-code, as a flowchart, or as actual program code. You need to be comfortable moving between all three representations.
Decomposition
Decomposition means breaking a large, complex problem into smaller, more manageable sub-problems. Each sub-problem accomplishes a specific, identifiable task. Sub-problems can themselves be further broken down, creating a hierarchy of manageable tasks.
Consider building a mobile banking app. At the top level it is one enormous problem. Decomposed, it becomes: user authentication, account balance display, payment processing, transaction history, and security alerts. Each of those can be decomposed further — payment processing breaks into input validation, fraud checks, bank transfer protocols, and confirmation messages. Each piece is now small enough for a developer (or a team) to tackle independently.
Suppose you are asked to build an online GP appointment booking system. Decomposing it gives at least four sub-problems:
- Patient login — verify identity securely
- Show available slots — fetch free appointment times from the database
- Book slot — write the booking and prevent double-booking
- Send confirmation — email or SMS reminder to the patient
Each sub-problem is now small enough to design, code and test independently. A team could work on all four simultaneously.
Abstraction
Abstraction means removing unnecessary detail so that you can focus on the information that actually matters. It is not about making things simpler than they are — it is about identifying which details are relevant and filtering out everything else.
The London Underground map is a classic example. Real tube lines curve, dip underground, and vary in spacing. A geographically accurate map would be too cluttered to use. The Underground map abstracts away distances and precise geography, keeping only the connections between stations and their order. That is all a passenger needs to plan a journey.
In programming, abstraction happens constantly. A variable named playerScore hides the actual memory address where the value is stored. A function called sendNotification() hides dozens of lines of networking code behind a single meaningful name. Programmers use abstraction to manage complexity at every scale.
Levels of Abstraction
Abstraction works at multiple levels. A sat-nav system abstracts away the physics of road surfaces, the full text of the Highway Code, and the mechanical workings of your car. It retains only: current position, destination, road network connections, and estimated speeds. The less detail the system has to process, the faster and clearer the route calculation.
Similarly, when you design an algorithm you make abstraction decisions: what are the inputs? What processing happens on them? What are the outputs? Everything else — the hardware it runs on, the user interface colour scheme — is abstracted away from the algorithm itself.
A school login system can be decomposed and abstracted as follows:
Decomposition: (1) Get username and password. (2) Check against stored records. (3) Either grant access or display an error.
Abstraction applied: The algorithm does not need to know how passwords are stored in the database, what operating system the server runs, or how the network packet gets from the student’s laptop to the server. It only needs: username, password, stored credentials, and a match/no-match decision.
Inputs: username, password. Processing: compare input to stored values. Output: “Access granted” or “Access denied.”
Why These Skills Matter
Decomposition and abstraction are not just theory — they are the practical habits of every professional software developer. When engineers at a social media company build a new feature for hundreds of millions of users, they start by decomposing the requirement into sub-tasks and abstracting away the hardware and infrastructure concerns. The same thinking applies when you write even a short program in school.
In your exam, you may be asked to explain what decomposition or abstraction means, apply them to a given scenario, or identify where they appear in a described system. Always ground your answer in the specific problem given, and apply the term to that scenario rather than repeating a generic definition.