Edexcel GCSE Computer Science Topic 1 Computational thinking: decomposition, abstraction, algorithms, trace tables, standard algorithms and truth tables

What Topic 1 actually demands

Computational thinking is the foundation of the whole qualification and the focus of the first Paper 1 question. You must be able to break problems down (decomposition), strip them to the essentials (abstraction), and express the solution as an algorithm using sequence, selection and repetition, in flowcharts, pseudocode or program code. You must trace algorithms with trace tables, classify and fix errors, know the four standard algorithms, judge efficiency, and complete truth tables with up to three inputs.

This guide ties together the six dot-point pages for Topic 1.

Decomposition, abstraction and subprograms

The two core skills are decomposition (breaking a complex problem into smaller, more manageable sub-problems that can each be solved and tested separately) and abstraction (removing or hiding unnecessary detail so only the relevant information remains, which is how a program models the real world). Subprograms apply decomposition to code: each sub-problem becomes a named function or procedure, which avoids repetition, is easier to test and debug, and makes a program easier to read and reuse.

Algorithms, operators and data structures

Algorithms are built from sequence (steps in order), selection (IF and ELSE) and repetition (count-controlled FOR loops and condition-controlled WHILE loops), following the input-process-output model. They use variables (changeable), constants (fixed) and data structures: strings, one- and two-dimensional arrays, and records. The operators come in three families: arithmetic (including DIV for the whole-number quotient and MOD for the remainder), relational (the six comparisons), and logical (AND, OR, NOT).

Trace tables and errors

A trace table dry-runs an algorithm by hand, recording each variable on a new row when it changes, so you can determine the output or a variable's value at any point, and locate logic errors. The three error types are syntax (breaks the language rules, will not run), logic (runs but gives the wrong result) and runtime (crashes during execution, such as dividing by zero).

Standard algorithms, efficiency and truth tables

The four standard algorithms are bubble sort and merge sort (sorting) and linear and binary search (searching). Efficiency is judged by the number of comparisons, the number of passes through a loop and the use of memory, using test data and logical reasoning to decide fitness for purpose. Truth tables list all $2^n$ input combinations and the output of a logical expression, built in stages with an intermediate column for each part.

Check your knowledge

A mix of recall and applied questions covering Topic 1. Attempt them, then check against the solutions.

1. State what is meant by decomposition. (1 mark)
2. State what abstraction removes from a model. (1 mark)
3. Give one benefit of using subprograms. (1 mark)
4. State the result of $19 \text{ MOD } 4$. (1 mark)
5. State the type of error that stops a program being translated. (1 mark)
6. State one condition needed before a binary search can be used. (1 mark)
7. State how many comparisons a binary search needs at most for 16 sorted items. (1 mark)
8. State how many rows a truth table with three inputs has. (1 mark)