June 2025: AS Paper 27: Decision Mathematics 1

40 marks · 14 question parts · Question paper, mark scheme and examiner's report on Pearson's site

Question by question

QTopicMarksDifficulty
1(a) Algorithms, sorting, bin packing and graph theory 3 —
1(b) Minimum spanning trees (Prim, Kruskal) and shortest paths (Dijkstra, Floyd) 2 —
1(c) Minimum spanning trees (Prim, Kruskal) and shortest paths (Dijkstra, Floyd) 2 —
2(a) Critical path analysis 1 —
2(b) Critical path analysis 5 —
2(c) Critical path analysis 1 —
2(d) Critical path analysis 1 —
3(a) Algorithms, sorting, bin packing and graph theory 1 —
3(b) Minimum spanning trees (Prim, Kruskal) and shortest paths (Dijkstra, Floyd) 6 —
3(c) Route inspection and the travelling salesman problem 5 —
3(d) Route inspection and the travelling salesman problem 2 —
4(a) Linear programming: formulation, graphs and the Simplex algorithm 1 —
4(b) Linear programming: formulation, graphs and the Simplex algorithm 5 —
4(c) Linear programming: formulation, graphs and the Simplex algorithm 5 —

The questions

1(a)1(b)1(c)2(a)2(b)2(c)2(d)3(a)3(b)3(c)3(d)4(a)4(b)4(c)
June 2025 · AS Paper 2 (Decision 1) · Q1(a) 3 marks algorithms and graph theory
1 16 10 25 30 13 12 28 22 23 20 The list of ten numbers above is to be sorted into ascending order. (a) Carry out a bubble sort, starting at the left-hand end of the list, to produce the sorted list. You should only give the state of the list after each pass. (3)
June 2025 · AS Paper 2 (Decision 1) · Q1(b) 2 marks minimum spanning trees and shortest paths
B E A F C Figure 1 (b) Use Prim’s algorithm, starting at A, to find the minimum spanning tree for the network in Figure 1. You must list the arcs in the order in which you select them. (2)
June 2025 · AS Paper 2 (Decision 1) · Q1(c) 2 marks minimum spanning trees and shortest paths
(c) (i) Draw the minimum spanning tree on Diagram 1 in the answer book. (ii) Find the weight of the minimum spanning tree. (2)
June 2025 · AS Paper 2 (Decision 1) · Q2(a) 1 mark critical path analysis
2 Activity Immediately preceding activities A - B - C - B E A, B F B G B H C, D I G, H J E K E, F, I L G, H M G, H (a) Explain how you can deduce from the precedence table that at least one dummy will be needed when drawing the activity network. Your explanation should refer to specific activities. (1)
June 2025 · AS Paper 2 (Decision 1) · Q2(b) 5 marks critical path analysis
(b) Draw the activity network described in the precedence table, using activity on arc. Your activity network must contain the minimum number of dummies only. (5)
June 2025 · AS Paper 2 (Decision 1) · Q2(c) 1 mark critical path analysis
Each activity in the precedence table takes 3 hours to complete. (c) State the minimum completion time. (1)
June 2025 · AS Paper 2 (Decision 1) · Q2(d) 1 mark critical path analysis
One of the activities now needs to be chosen to be extended by an hour. When the change is made the minimum completion time must not be affected. (d) List the activities that could be chosen. (1)
June 2025 · AS Paper 2 (Decision 1) · Q3(a) 1 mark algorithms and graph theory
3 B H A F C J E G Figure 2 [The total weight of the network is 153] Figure 2 models a network of roads in a town, where the nodes represent road junctions. The numbers on the edges are the times, in minutes, taken to walk along the corresponding roads. (a) State, with a reason, whether the graph in Figure 2 is Eulerian, semi-Eulerian or neither. (1)
June 2025 · AS Paper 2 (Decision 1) · Q3(b) 6 marks minimum spanning trees and shortest paths
(b) (i) Use Dijkstra’s algorithm to find the quickest path from A to J. (ii) State the shortest time needed to walk from A to J. (6)
June 2025 · AS Paper 2 (Decision 1) · Q3(c) 5 marks route inspection and travelling salesman
Ruby manages road maintenance from her office located at junction B. She needs to walk along each road at least once, starting and finishing at her office. Road AE is temporarily blocked so she is unable to walk along it. Ruby wishes to minimise her journey time. (c) (i) Use an appropriate algorithm to find the roads that Ruby needs to traverse twice. You must make your method and working clear. (ii) Calculate Ruby’s journey time. (5)
June 2025 · AS Paper 2 (Decision 1) · Q3(d) 2 marks route inspection and travelling salesman
Ruby can save some time by choosing to start her route from any junction and to finish at her home at A. Road AE is still blocked and Ruby again wishes to minimise her journey time. (d) (i) Write down the junction at which Ruby should start. (ii) Calculate how much time she would save. (2)
June 2025 · AS Paper 2 (Decision 1) · Q4(a) 1 mark linear programming
4 y x Figure 3 George is a baker who bakes x sponge cakes and y fruit cakes every day. One of George’s constraints is shown on Figure 3. (a) Write down this constraint as a simplified inequality with integer coefficients. (1)
June 2025 · AS Paper 2 (Decision 1) · Q4(b) 5 marks linear programming
Three further constraints are • George must bake at least four fruit cakes every day • for every two sponge cakes George bakes, he must bake at most three fruit cakes • George needs 200 g of butter for each sponge cake and 100 g for each fruit cake and has 2.8 kg of butter available each day (b) (i) Write down the three inequalities which model these constraints. Give your answers in simplified form with integer coefficients. (ii) Add lines and shading to Diagram 1 in the answer book to represent these three constraints. Hence determine the feasible region and label it R. (5)
June 2025 · AS Paper 2 (Decision 1) · Q4(c) 5 marks linear programming
George makes £8 profit from each sponge cake he sells and £5 profit from each fruit cake he sells. Given that he wishes to maximise his profit, (c) use the vertex method to determine the number of sponge cakes and the number of fruit cakes George should bake each day. You must make your method and working clear. (5)

Find an Edexcel Further Maths tutor

Want this paper marked and gone through with a Further Maths tutor? Message us.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.