Oct 2020: AS Paper 28: Decision Mathematics 2

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

Question by question

QTopicMarksDifficulty
1(a) Flows in networks 2 —
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 1 —
2(c) Allocation (assignment) problems and the Hungarian algorithm 6 —
3(a) Game theory 2 —
3(b) Game theory 4 —
3(c) Game theory 1 —
3(d) Game theory 7 —
4 Recurrence relations (Decision 2) 8 —

The questions

1(a)1(b)1(c)1(d)1(e)2(a)2(b)2(c)3(a)3(b)3(c)3(d)4
Oct 2020 · AS Paper 2 (Decision 2) · Q1(a) 2 marks flows in networks
1. C2 C1 18 15 A 15 15 13 10 12 10 E 29 26 T S 37 32 B x y 18 18 C F 26 23 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) (i) Find the value of x. (ii) Find the value of y. (2)
Oct 2020 · AS Paper 2 (Decision 2) · Q1(b) 1 mark flows in networks
(b) List the saturated arcs. (1)
Oct 2020 · AS Paper 2 (Decision 2) · Q1(c) 2 marks flows in networks
Two cuts, C1 and C2, are shown in Figure 1. (c) Find the capacity of (i) C1 (ii) C2 (2)
Oct 2020 · AS Paper 2 (Decision 2) · Q1(d) 1 mark flows in networks
(d) Write down a flow‑augmenting route, using the arc CF, that increases the flow by two units. (1)
Oct 2020 · AS Paper 2 (Decision 2) · Q1(e) 3 marks flows in networks
Given that the flow through the network is increased by two units using the route found in (d), (e) prove that this new flow is maximal. (3)
Oct 2020 · AS Paper 2 (Decision 2) · Q2(a) 2 marks allocation problems
2. Four workers, A, B, C and D, are each to be assigned to one of four tasks, P, Q, R and S. Each worker must be assigned to one task, and each task must be done by exactly one worker. Worker C cannot be assigned to task Q. The amount, in pounds, that each worker would earn when assigned to each task is shown in the table below. P Q R S A B C – The Hungarian algorithm is to be used to find the maximum total amount that can be earned by the four workers. (a) Explain how the table should be modified so that the Hungarian algorithm may be applied. (2)
Oct 2020 · AS Paper 2 (Decision 2) · Q2(b) 1 mark allocation problems
(b) Modify the table so that the Hungarian algorithm may be applied. (1)
Oct 2020 · AS Paper 2 (Decision 2) · Q2(c) 6 marks allocation problems
(c) Reducing rows first, use the Hungarian algorithm to obtain an allocation that maximises the total earnings. You should explain how any initial row and column reductions were made and also how you determined if the table was optimal at each stage. (6)
Oct 2020 · AS Paper 2 (Decision 2) · Q3(a) 2 marks game theory
3. Two teams, A and B, each have three team members. One member of Team A will compete against one member of Team B for 10 rounds of a competition. None of the rounds can end in a draw. Table 1 shows, for each pairing, the expected number of rounds that the member of Team A will win minus the expected number of rounds that the member of Team B will win. These numbers are the scores awarded to Team A. This competition between Teams A and B is a zero‑sum game. Each team must choose one member to play. Each team wants to choose the member who will maximise its score. Team B Paul Qaasim Rashid Mischa –6 Team A Noel –2 Olive –6 Table 1 (a) (i) Find the number of rounds that Team A expects to win if Team A chooses Mischa and Team B chooses Paul. (ii) Find the number of rounds that Team B expects to win if Team A chooses Noel and Team B chooses Qaasim. (2)
Oct 2020 · AS Paper 2 (Decision 2) · Q3(b) 4 marks game theory
Table 1 models this zero-sum game. (b) (i) Find the play‑safe strategies for the game. (ii) Explain how you know that the game is not stable. (4)
Oct 2020 · AS Paper 2 (Decision 2) · Q3(c) 1 mark game theory
(c) Determine which team member Team B should choose if Team B thinks that Team A will play safe. Give a reason for your answer. (1)
Oct 2020 · AS Paper 2 (Decision 2) · Q3(d) 7 marks game theory
At the last minute, Rashid is ill and is therefore unavailable for selection by Team B. (d) Find the best strategy for Team B, defining any variables you use. (7)
Oct 2020 · AS Paper 2 (Decision 2) · Q4 8 marks recurrence relations d2
4. A sequence {un}, where n 1, satisfies the recurrence relation 2un = un – 1 – kn2 where 4u2 – u0 = 27k2 and k is a non‑zero constant. Show that, as n becomes large, un can be approximated by a quadratic function of the form an2 + bn + c where a, b and c are constants to be determined. (8)

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.