OCR Further Maths · Unit 4

Discrete Mathematics (Y544) quizzes

15 ready‑made quiz sets for Unit 4: Discrete Mathematics (Y544), 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: Discrete Mathematics (Y544) in the OCR Further Maths (H245), 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.

15 lesson sets in Unit 4: Discrete Mathematics (Y544)

20 questions
7.01a-c Existence problems, set notation and the pigeonhole principle
20 questions · by Revision Ninja
20 questions
7.01d-k Arrangements, multiplicative principle and inclusion-exclusion
20 questions · by Revision Ninja
20 questions
7.02a-e Graph terminology, complete and bipartite graphs
20 questions · by Revision Ninja
20 questions
7.02g-p Eulerian and Hamiltonian graphs, isomorphism, digraphs, planarity and networks
20 questions · by Revision Ninja
20 questions
7.03a-e Algorithms, tracing and efficiency
20 questions · by Revision Ninja
20 questions
7.03i-m Sorting algorithms and bin packing
20 questions · by Revision Ninja
20 questions
7.04a-c Shortest paths, minimum spanning trees and nearest neighbour
20 questions · by Revision Ninja
20 questions
7.04e-f Route inspection and choosing a network algorithm
20 questions · by Revision Ninja
20 questions
7.05a Critical path analysis
20 questions · by Revision Ninja
20 questions
7.06a-b Formulating linear programming problems and slack variables
20 questions · by Revision Ninja
20 questions
7.06c-e Graphical solutions and the effect of changing constraints
20 questions · by Revision Ninja
20 questions
7.07a-d Simplex tableaux and basic feasible solutions
20 questions · by Revision Ninja
20 questions
7.07e Iterations of the simplex algorithm and its graphical interpretation
20 questions · by Revision Ninja
20 questions
7.08a-c Zero-sum games, pure strategies and Nash equilibrium
20 questions · by Revision Ninja
20 questions
7.08e-f Mixed strategies and optimal mixed strategies
20 questions · by Revision Ninja

15 lesson sets in Unit 4: Discrete Mathematics (Y544)

7.01a-c Existence problems, set notation and the pigeonhole principle

7.01d-k Arrangements, multiplicative principle and inclusion-exclusion

7.02a-e Graph terminology, complete and bipartite graphs

7.02g-p Eulerian and Hamiltonian graphs, isomorphism, digraphs, planarity and networks

7.03a-e Algorithms, tracing and efficiency

7.03i-m Sorting algorithms and bin packing

7.04a-c Shortest paths, minimum spanning trees and nearest neighbour

7.04e-f Route inspection and choosing a network algorithm

7.05a Critical path analysis

7.06a-b Formulating linear programming problems and slack variables

7.06c-e Graphical solutions and the effect of changing constraints

7.07a-d Simplex tableaux and basic feasible solutions

7.07e Iterations of the simplex algorithm and its graphical interpretation

7.08a-c Zero-sum games, pure strategies and Nash equilibrium

7.08e-f Mixed strategies and optimal mixed strategies