← Computer Science syllabus

EnglandComputer Science

3.1 Fundamentals of algorithms

4 dot points across 4 inquiry questions. Click any dot point for a focused answer with worked past exam questions where available.

How do we break a problem down so a computer can solve it?

Computational thinking through abstraction, decomposition and algorithmic thinking, and understanding what an algorithm is and the difference between an algorithm and a program.
A focused answer to AQA GCSE Computer Science 3.1.1, covering abstraction, decomposition and algorithmic thinking, what an algorithm is, and how an algorithm differs from a program.
7 min answer →

How do we write down an algorithm clearly before we code it?

Represent and interpret algorithms using flowcharts and pseudocode, recognise the standard flowchart symbols, and read and write AQA-style pseudocode.
A focused answer to AQA GCSE Computer Science 3.1.2, covering how to represent algorithms with flowcharts and pseudocode, the standard flowchart symbols, and reading and writing AQA-style pseudocode.
8 min answer →

How do computers find an item in a list quickly?

Understand and explain how the linear search and binary search algorithms work, trace each one, and compare them including the requirement that binary search needs a sorted list.
A focused answer to AQA GCSE Computer Science 3.1.3, covering how linear search and binary search work, how to trace each one, and how they compare including why binary search needs a sorted list.
8 min answer →

How do computers put a list of values into order?

Understand and explain how the bubble sort and merge sort algorithms work, trace each one, and compare them in terms of method and efficiency.
A focused answer to AQA GCSE Computer Science 3.1.4, covering how bubble sort and merge sort work, how to trace each one, and how they compare in method and efficiency.
8 min answer →