levo

Computational Thinking

Decomposition, abstraction and subprograms

  • 3 things to know
  • Paper 1

Overview

Decomposition and abstraction with worked examples from maps, games and school reports, and how subprograms save time, simplify testing and maintenance, and can be reused.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

Define decomposition.

Key term

Define abstraction.

Key term

Why does decomposition make a large problem easier to solve?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    Define decomposition.

    Model answer

    Decomposition is breaking a problem down into smaller sub-problems. Each sub-problem is simple enough to understand and solve on its own.

  2. 2

    Define abstraction.

    Model answer

    Abstraction is removing detail that does not matter to the problem being solved. Only the features needed for the solution are kept.

  3. 3

    Why does decomposition make a large problem easier to solve?

    Model answer

    A small sub-problem is easier to understand than the whole problem at once. Each part can be solved, written and tested separately.

  4. 4

    Explain how decomposition helps a team of programmers.

    Model answer

    Different sub-problems can be handed to different programmers. The team can then work on several parts at the same time.

  5. 5

    A map of a railway network shows the stations and the lines between them but not the real distances. Which technique does the map use, and why?

    Model answer

    The map is an abstraction of the real network. A passenger only needs the order of stations and the connections, so the rest is left out.

  6. 6

    A program models a game of noughts and crosses. Which details of a real game would abstraction remove?

    Model answer

    Abstraction would remove the pen, the paper and the players’ appearance. The model keeps only the 3 × 3 grid, the marks and whose turn it is.

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book
2Open book
3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Computational Thinking
Data
Computers
Networks

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

The check is 45 + 27 = 72.
denarybinaryhexadecimal

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

AA normal test value is 14.
BA boundary test value is 16.
CAn erroneous test value is 20.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

A kibibyte (KiB) is 1,024 bytes. The figure 1,024 is 2¹⁰.
TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Computational Thinking, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Or £46 a year, about £3.83 a month. Cancel anytime.