Computational thinking skills

Computer Science AS · Algorithm design and problem-solving. The idea in plain words, the rules to remember, the mistake to avoid and a worked example, written and checked by Mega Lecture.

Test this topic freeAll Computer Science AS topics

The idea

Computational thinking is a way of approaching a problem so that a computer can help to solve it. Two of its skills are abstraction and decomposition.

Abstraction means keeping only the details that are needed to solve the problem and leaving out the rest. The result is an abstract model: a simpler version of the real system. A map is a good example. It shows roads and towns but not every tree.

Decomposition means breaking a problem into smaller sub-problems, and breaking those down again, until each one is easy to solve. Each small part can then be written as a program module, which is a procedure or a function.

Rules to remember

Common mistake

Students swap the two terms. Abstraction removes detail; decomposition splits the problem into parts. Neither one is the same as writing the code.

Worked example

A program will calculate the cost of delivering a parcel. The cost depends on the weight of the parcel and the distance travelled. Which of these belong in the abstract model: weight, colour of the box, distance, name of the driver?

  1. The purpose of the model is to calculate a delivery cost.
  2. Weight and distance are used in the calculation, so they are essential details.
  3. The colour of the box and the name of the driver do not change the cost, so abstraction removes them.

Answer: Keep weight and distance; leave out the colour of the box and the name of the driver.

Ask about this

Type what you are stuck on. The helper finds the explanation, worked examples and the notes to read, free and instant.

Keep going

← Data Definition Language (DDL) and Data Manipulation Language (DML)Algorithms →Take a Computer Science AS test