AQA Computer Science · Unit 3
Fundamentals of algorithms quizzes
8 ready‑made quiz sets for Unit 3: Fundamentals of algorithms, 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 3: Fundamentals of algorithms 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.
8 lesson sets in Unit 3: Fundamentals of algorithms
- 20Qs questions
4.3.1.1 Breadth-first and depth-first search
20 questions · by Revision Ninja
- 20Qs questions
4.3.2.1 Pre-order, post-order and in-order traversal
20 questions · by Revision Ninja
- 20Qs questions
4.3.3.1 Infix to Reverse Polish notation
20 questions · by Revision Ninja
- 20Qs questions
4.3.4.1 Linear and binary search
20 questions · by Revision Ninja
- 20Qs questions
4.3.4.3 Binary tree search
20 questions · by Revision Ninja
- 20Qs questions
4.3.5.1 Bubble sort
20 questions · by Revision Ninja
- 20Qs questions
4.3.5.2 Merge sort
20 questions · by Revision Ninja
- 20Qs questions
4.3.6.1 Dijkstra's shortest path algorithm
20 questions · by Revision Ninja