AQA A Level Further Maths Paper 3 Discrete November 2021 question paper

Which of the following statements about critical path analysis is always true?

Tick () one box.

All activity networks have exactly one critical path.

All critical activities have a non-zero float.

The first activity in a critical path has an earliest start time of zero.

A delay on a critical activity may not delay the project.

The network below represents a system of pipes.

The numbers on each arc represent the lower and upper capacity for each pipe.

Find the value of the cut { A, B, C, D, E } { F, G, H, I }.

Circle your answer.

56 58 63 70

A mining company wants to open a new mine in an area where the ground contains a precious metal.

The mining company has carried out a survey of the area. The network below shows nodes which represent the entrance to the new mine, X, and the 8 ventilation shafts, A, B, …, H, which have been installed to prevent the build up of dangerous gases underground.

Each arc represents a possible underground tunnel which could be mined.

The weight on each arc represents the estimated amount of precious metal in that possible underground tunnel in tonnes.

Due to geological reasons, the mining company can only create 8 underground tunnels.

All 8 ventilation shafts must be accessible from the entrance of the mine.

The mining company wants to maximise the amount of precious metal it can extract from the new mine.

Determine the tunnels the mining company should use.

Estimate the maximum amount of precious metal the mining company can extract from the new mine.

Comment on why the maximum amount of precious metal the mining company can extract from the new mine may be different from your answer to part (a)(ii).

Before the mining company begins work on the new mine, a government survey prevents the mining company drilling the tunnel represented by CF.

Determine the effect, if any, the government survey has on your answers to part (a)(i) and part (a)(ii).

Derrick, a tanker driver, is required to deliver fuel to 6 different service stations A, B, C, D, E and F.

Derrick needs to begin and finish his delivery journey at the refinery O.

The distances, in miles, between the 7 locations which have a direct road between them are shown in the network below.

Derrick spends 30 minutes at each service station to complete the fuel delivery.

When driving, the tanker travels at an average speed of 40 miles per hour.

The minimum total time that it takes Derrick to travel to and deliver fuel to all 6 service stations, starting and finishing at the refinery, is T minutes.

Using the nearest neighbour algorithm starting from the refinery, find an upper bound for T

Before setting off to make his fuel deliveries, Derrick is notified that, due to a low bridge, the road represented by CE is not suitable for tankers to travel along.

State, with a reason, the effect this new information has on your answer to part (a).

Describe the conditions necessary for a set of elements, S, under a binary operation * to form a group.

In the multiplicative group of integers modulo 13, the group G is defined as

Explain why G is an abelian group.

Find the order of G.

State the identity element of G and prove it is an identity element.

Fully justify your answer.

Find all the proper non-trivial subgroups of G, giving your answers in the form (g, ₁₃), where g is an integer less than 13

A connected planar graph has (x 1)² vertices, (25 2x 2y) edges and

Find the possible values for the number of vertices, edges and faces for the graph.

Explain why K₆, the complete graph with 6 vertices, is not planar.

Fully justify your answer.

Avon wants to know the optimal mixed strategy he should play in order to maximise his winnings from the game.

Avon defines the following variables:

p₁ the probability of Avon playing strategy A₁

p₂ the probability of Avon playing strategy A₂

p₃ the probability of Avon playing strategy A₃

v the value of the game for Avon

Formulate Avon’s situation as a linear programming problem.

Using your answer to part (a), complete the initial Simplex tableau for Avon’s situation in the grid below.

Hence, perform one iteration of the Simplex algorithm, showing your answer on the grid below.

Avon performs further iterations of the Simplex algorithm until an optimal solution is reached.

The grid below shows part of Avon’s final Simplex tableau.

Find the optimal mixed strategy for Avon.

Find the value of the game for Avon.

Roj thinks that his best outcome from the game is to play strategy R₂ each time.

Avon notices that Roj always plays strategy R₂ and Avon wants to use this knowledge to maximise his expected pay-off from the game.

Explain how your answer to part (c)(i) should change and find Avon’s maximum expected pay-off from the game.