IB Computer Science: Computational Thinking Revision

Computational Thinking is a core part of IB Computer Science. Revise the key concepts and common mistakes below, then lock them in with the free games.

Key concepts

AlgorithmA precise step-by-step method for solving a problem.

Pseudocode & flowchartsWays to express an algorithm before coding.

SearchingLinear search (any list) and binary search (sorted list).

SortingOrdering data, e.g. bubble, merge and insertion sort.

DecompositionBreaking a problem into smaller parts.

AbstractionHiding unnecessary detail to focus on what matters.

SchedulerPicks the next process to run on CPU.

FCFSFirst Come First Served, simple queue.

SJFShortest Job First minimises average wait.

Round-robinEach process runs for a fixed quantum.

PreemptionOS pauses a process to run another.

ThroughputJobs completed per unit time.

InterruptHardware signal requesting CPU attention.

PollingCPU repeatedly checks device status.

Common mistakes to avoid

Questions where students often pick the tempting wrong answer — make sure you know the right one:

Must an algorithm be written in code?✗ Yes, an algorithm has to be program code. ✓ No — it's a step-by-step method (e.g. pseudocode or a flowchart).

What does a binary search need to work?✗ It works on any unsorted list. ✓ A sorted list.

Practise Computational Thinking — free games

Test yourself with these quick revision games for this topic:

▶ Two Truths, One Lie ▶ Reveal Race ▶ Connections Grid ▶ Falling Words ▶ Word Web

See all 17 games in the Subjects Arcade →

Computational Thinking

Key concepts

Common mistakes to avoid

Practise Computational Thinking — free games

More IB Computer Science topics