June 2024: AS Paper 28: Decision Mathematics 2

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

Question by question

QTopicMarksDifficulty
1(a) Flows in networks 1 —
1(b) Flows in networks 1 —
1(c) Flows in networks 2 —
1(d) Flows in networks 1 —
1(e) Flows in networks 3 —
2(a) Allocation (assignment) problems and the Hungarian algorithm 2 —
2(b) Allocation (assignment) problems and the Hungarian algorithm 6 —
3(a) Game theory 2 —
3(b) Game theory 1 —
3(c) Game theory 7 —
3(d) Game theory 4 —
4(a) Recurrence relations (Decision 2) 1 —
4(b) Recurrence relations (Decision 2) 5 —
4(c) Recurrence relations (Decision 2) 1 —
4(d) Recurrence relations (Decision 2) 3 —

The questions

1(a)1(b)1(c)1(d)1(e)2(a)2(b)3(a)3(b)3(c)3(d)4(a)4(b)4(c)4(d)
June 2024 · AS Paper 2 (Decision 2) · Q1(a) 1 mark flows in networks
1. C1 C2 E A H B F S T J C G K C1 C2 Figure 1 Figure 1 shows a capacitated, directed network of pipes. The number on each arc represents the capacity of the corresponding pipe. The numbers in circles represent a feasible flow from S to T. (a) State the value of this flow. (1)
June 2024 · AS Paper 2 (Decision 2) · Q1(b) 1 mark flows in networks
(b) Explain why arcs CD and CG cannot both be saturated. (1)
June 2024 · AS Paper 2 (Decision 2) · Q1(c) 2 marks flows in networks
(c) Find the capacity of (i) cut C1 (ii) cut C2 (2)
June 2024 · AS Paper 2 (Decision 2) · Q1(d) 1 mark flows in networks
(d) Write down a flow augmenting route of weight 6 which saturates BF. (1)
June 2024 · AS Paper 2 (Decision 2) · Q1(e) 3 marks flows in networks
The flow augmenting route in part (d) is applied to give an increased flow. (e) Prove that this increased flow is maximal. (3)
June 2024 · AS Paper 2 (Decision 2) · Q2(a) 2 marks allocation problems
2. A team of 5 players, A, B, C, D and E, competes in a quiz. Each player must answer one of 5 rounds, P, Q, R, S and T. Each player must be assigned to exactly one round, and each round must be answered by exactly one player. Player B cannot answer round Q, player D cannot answer round T, and player E cannot answer round R. The number of points that each player is expected to earn in each round is shown in the table. P Q R S T A B – C – E – The team wants to maximise its total expected score. The Hungarian algorithm is to be used to find the maximum total expected score that can be earned by the 5 players. (a) Explain how the table should be modified. (2)
June 2024 · AS Paper 2 (Decision 2) · Q2(b) 6 marks allocation problems
(b) (i) Reducing rows first, use the Hungarian algorithm to obtain an allocation which maximises the total expected score. (ii) Calculate the maximum total expected score. (6)
June 2024 · AS Paper 2 (Decision 2) · Q3(a) 2 marks game theory
3. Haruki and Meera play a zero‑sum game. The game is represented by the following pay‑off matrix for Haruki. Meera Option X Option Y Option Z Option A –2 –5 Option B –3 Haruki Option C –1 Option D –4 (a) Determine whether the game has a stable solution. (2)
June 2024 · AS Paper 2 (Decision 2) · Q3(b) 1 mark game theory
Option Y for Meera is now removed. (b) Write down the reduced pay‑off matrix for Meera. (1)
June 2024 · AS Paper 2 (Decision 2) · Q3(c) 7 marks game theory
(c) (i) Given that Meera plays Option X with probability p, determine her best strategy. (ii) State the value of the game to Haruki. (iii) State which option(s) Haruki should never play. (7)
June 2024 · AS Paper 2 (Decision 2) · Q3(d) 4 marks game theory
The number of points scored by Haruki when he plays Option C and Meera plays Option X changes from –1 to k Given that the value of the game is now the same for both players, (d) determine the value of k. You must make your method and working clear. (4)
June 2024 · AS Paper 2 (Decision 2) · Q4(a) 1 mark recurrence relations d2
4. Peter sets up a savings plan. He makes an initial deposit of £D and then pays in £M at the end of each month. The value of the savings plan, in pounds, is modelled by un+1 = 1.025 un + 1800 where n 0 is an integer and un is the total value of the savings plan, in pounds, after n years. (a) Calculate the value of M (1)
June 2024 · AS Paper 2 (Decision 2) · Q4(b) 5 marks recurrence relations d2
Given that the value of the savings plan after 1 year is £6 925 (b) solve the recurrence relation for un (5)
June 2024 · AS Paper 2 (Decision 2) · Q4(c) 1 mark recurrence relations d2
(c) Determine the value of D (1)
June 2024 · AS Paper 2 (Decision 2) · Q4(d) 3 marks recurrence relations d2
(d) Hence determine, using algebra, the number of years it will take for the value of the savings plan to exceed £20 000 (3)

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.