AQA Further Maths · Unit 5

Optional application 3: discrete mathematics quizzes

16 ready‑made quiz sets for Unit 5: Optional application 3: discrete mathematics, 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 5: Optional application 3: discrete mathematics in the AQA Further Maths (7367), 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.

16 lesson sets in Unit 5: Optional application 3: discrete mathematics

20 questions
DA1-DA3 Graph language, Eulerian graphs and Euler's formula
20 questions · by Revision Ninja
20 questions
DA4-DA5 Planarity, complete and bipartite graphs
20 questions · by Revision Ninja
20 questions
DA6-DA7 Trees and isomorphism of graphs
20 questions · by Revision Ninja
20 questions
DB1-DB3 Network language, spanning trees and route inspection
20 questions · by Revision Ninja
20 questions
DB4-DB5 Travelling salesperson bounds and refining network models
20 questions · by Revision Ninja
20 questions
DC1-DC3 Flows, cuts and the maximum flow-minimum cut theorem
20 questions · by Revision Ninja
20 questions
DC4-DC7 Supersources, augmenting flows and capacities
20 questions · by Revision Ninja
20 questions
DD1-DD2 Formulating and solving linear programmes graphically
20 questions · by Revision Ninja
20 questions
DD3-DD4 The Simplex algorithm
20 questions · by Revision Ninja
20 questions
DE1-DE3 Activity networks and critical paths
20 questions · by Revision Ninja
20 questions
DE4-DE6 Refining models, Gantt charts and resource levelling
20 questions · by Revision Ninja
20 questions
DF1-DF4 Pay-off matrices, play-safe strategies and dominance
20 questions · by Revision Ninja
20 questions
DF5-DF6 Optimal mixed strategies and linear programming
20 questions · by Revision Ninja
20 questions
DG1-DG4 Binary operations, commutativity, associativity and Cayley tables
20 questions · by Revision Ninja
20 questions
DG5-DG8 Identity, inverses and the group axioms
20 questions · by Revision Ninja
20 questions
DG9-DG12 Finite and infinite groups, subgroups, Lagrange's theorem and isomorphism
20 questions · by Revision Ninja

16 lesson sets in Unit 5: Optional application 3: discrete mathematics

DA1-DA3 Graph language, Eulerian graphs and Euler's formula

DA4-DA5 Planarity, complete and bipartite graphs

DA6-DA7 Trees and isomorphism of graphs

DB1-DB3 Network language, spanning trees and route inspection

DB4-DB5 Travelling salesperson bounds and refining network models

DC1-DC3 Flows, cuts and the maximum flow-minimum cut theorem

DC4-DC7 Supersources, augmenting flows and capacities

DD1-DD2 Formulating and solving linear programmes graphically

DD3-DD4 The Simplex algorithm

DE1-DE3 Activity networks and critical paths

DE4-DE6 Refining models, Gantt charts and resource levelling

DF1-DF4 Pay-off matrices, play-safe strategies and dominance

DF5-DF6 Optimal mixed strategies and linear programming

DG1-DG4 Binary operations, commutativity, associativity and Cayley tables

DG5-DG8 Identity, inverses and the group axioms

DG9-DG12 Finite and infinite groups, subgroups, Lagrange's theorem and isomorphism