AQA Computer Science · Unit 4
Theory of computation quizzes
13 ready‑made quiz sets for Unit 4: Theory of computation, one for every lesson, in course order. Pick one, put it on the board and host it live — students answer on their own devices.
- Free to host
- 20 questions per lesson
- Students join by code
Each set covers one lesson of Unit 4: Theory of computation in the AQA Computer Science (7517), with 20 multiple-choice questions on a timed countdown. Open a set to read its revision notes, host it straight away or save it to your library.
13 lesson sets in Unit 4: Theory of computation
- 20Qs questions
4.4.1.1 Problem-solving and algorithms
20 questions · by Revision Ninja
- 20Qs questions
4.4.1.3 Abstraction
20 questions · by Revision Ninja
- 20Qs questions
4.4.1.8 Problem reduction and decomposition
20 questions · by Revision Ninja
- 20Qs questions
4.4.1.10 Composition
20 questions · by Revision Ninja
- 20Qs questions
4.4.1.11 Automation
20 questions · by Revision Ninja
- 20Qs questions
4.4.2.1 Finite state machines
20 questions · by Revision Ninja
- 20Qs questions
4.4.2.3 Regular expressions
20 questions · by Revision Ninja
- 20Qs questions
4.4.3.1 Backus-Naur Form and syntax diagrams
20 questions · by Revision Ninja
- 20Qs questions
4.4.4.1 Comparing algorithms
20 questions · by Revision Ninja
- 20Qs questions
4.4.4.3 Order of complexity
20 questions · by Revision Ninja
- 20Qs questions
4.4.4.4 Limits of computation and computable problems
20 questions · by Revision Ninja
- 20Qs questions
4.4.4.7 The halting problem
20 questions · by Revision Ninja
- 20Qs questions
4.4.5.1 The Turing machine
20 questions · by Revision Ninja