Minimum spanning trees: OCR A‑Level Further Maths questions
OCR A-Level Further Maths past-paper questions on 2.2 Minimum spanning trees, 2018–2025, with mark schemes and examiner’s reports where available. Add MadAsMaths questions to your practice, or browse them separately by topic and difficulty.
Questions from
Paper
All papers
Exam
All years
All 9 questions on Minimum spanning trees, as a list
- June 2025, AS Discrete Mathematics, Q3 (9 marks): The table shows the lengths in km of footpaths between six places, A to F, in a town. A B C D E F A – 5 3 5 8 10 B 5 – 6 2 7 5 C 3 6 – 1 10 8 D 5 2 1 – 9 4 E 8
- June 2024, AS Discrete Mathematics, Q5 (10 marks): A garden centre sells mixed packs of flower bulbs. Each pack contains bulbs which produce flowers of two different colours. The cost, in £, of a pack of each co
- June 2023, AS Discrete Mathematics, Q2 (6 marks): A network is shown below. A 4 3 2 E B 15 9 5 8 2 C D (a) Use an appropriate algorithm to find the least weight (shortest) path from A to D. [3] (b) Use Kruskal’
- June 2022, AS Discrete Mathematics, Q6 (9 marks): Eight footpaths connect six villages. The lengths of these footpaths, in km, are given in the table. Villages connected A B A D B E B F C D C E D E E F Length o
- November 2021, Discrete Mathematics, Q7 (15 marks): A network is formed by weighting the graph below using the listed arc weights. 2.9 0.9 1.5 3.5 4.2 5.3 4.7 2.3 (a) (i) Show the result after the first pass and
- November 2021, AS Discrete Mathematics, Q3 (10 marks): The diagram shows a simplified map of the main streets in a small town. B 2.1 D 0.6 0.8 0.6 1.2 F X 0.9 A Y 1.1 0.4 0.8 0.7 1.0 E C 2.0 Some of the junctions ha
- November 2020, Discrete Mathematics, Q5 (17 marks): The manager of a farm shop wants to pave routes on the farm so that, after visiting the shop, customers can visit the animals in fields A, B, C, D and E. The ta
- November 2020, AS Discrete Mathematics, Q3 (8 marks): D B F H A G E C (a) By listing the vertices passed through, in the order they are used, give an example for the graph above of: (i) a walk from A to H that is n
- June 2018, AS Discrete Mathematics, Q4 (8 marks): The complete bipartite graph K3, 4 connects the vertices {2, 4, 6} to the vertices {1, 3, 5, 7}. (i) How many arcs does the graph K3, 4 have? [1] (ii) Deduce ho
Questions, mark schemes and examiner’s reports are © OCR, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? OCR A-Level Further Maths past papers.
The Plumi iPad app also offers exam-style questions with AI feedback on your handwritten working.