OCR A Level Further Maths A Discrete Mathematics (optional - choose any two of Y542/Y543/Y544/Y545) June 2023 question paper Y544

The table below shows the activities involved in a project together with the immediate predecessors and the duration of each activity.

Model the project using an activity network.

Determine the minimum project completion time.

The start of activity C is delayed by 2 hours.

Determine the minimum project completion time with this delay.

A graph is shown below.

Write down a cycle through all six vertices.

Write down a continuous route that uses every arc exactly once.

Use Kuratowski’s theorem to show that the graph is not planar.

Show that the graph has thickness 2.

An initial simplex tableau is given below.

Carry out two iterations of the simplex algorithm, choosing the first pivot from the x column.

After three iterations the resulting tableau is as follows.

State the values of P, x, y, z, s and t that result from these three iterations.

Explain why no further iterations are possible.

The initial simplex tableau is changed to the following, where k is a positive real value.

After one iteration of the simplex algorithm the value of P is 500.

Deduce the value of k.

The first 20 consecutive positive integers include the 8 prime numbers 2, 3, 5, 7, 11, 13, 17 and 19.

Emma randomly chooses 5 distinct numbers from the first 20 consecutive positive integers. The order in which Emma chooses the numbers does not matter.

Calculate the number of possibilities in which Emma’s 5 numbers include exactly 2 prime

numbers and 3 non-prime numbers.

Calculate the number of possibilities in which Emma’s 5 numbers include at least 2 prime

numbers.

The pairs {3, 13} and {7, 17} each consist of numbers with a difference of exactly 10.

Calculate the number of possibilities in which Emma’s 5 numbers include at least one pair of

prime numbers in which the difference between them is exactly 10.

A new set of 20 consecutive positive integers, each with at least two digits, is chosen. This set of 20 numbers contains 5 prime numbers.

Use the pigeonhole principle to show that there is at least one pair of these prime numbers for

which the difference between them is exactly 10.

A list of 8 values is given below.

3 24 8 1 4 20 30 18

The list is to be sorted into increasing order using quick sort, as given in the Formulae Booklet.

Carry out the first two passes of the sort.

A different list of 8 values is to be sorted into increasing order using quick sort, as given in the Formulae Booklet.

State the maximum number of passes that could be required.

Find the minimum number of passes that could be required.

The run-time for quick sort could be measured by counting the number of comparisons used.

In the worst case, the run time for quick sort is O(n²).

A computer takes at most 0.03 seconds to sort a list of 100 values into increasing order using quick sort.

Calculate an estimate for the time taken, in the worst case, to sort a list of 500 values using

quick sort.

A list of n values (where n > 10) is to be sorted into increasing order using quick sort, as given in the Formulae Booklet.

Explain why, in the best case, n - 3 comparisons are used in the second pass.

A graph is shown in Fig. 1.1. The graph is weighted to form the network represented by the weighted matrix in Fig. 1.2. The weights represent distances in km. A dash (-) means that there is no direct arc between that pair of vertices.

Fig. 1.1
Fig. 1.2

The shortest path from D to F has total weight 6.

Write down a path from D to F of total weight 6.

The total weight of the 12 arcs in the network is 56.

Use the route inspection algorithm to calculate the total weight of the least weight route that

covers every arc at least once, starting at vertex A.

Determine the total weight of the least weight route that covers every arc at least once,

starting at vertex B but finishing at any vertex.

Sasha wants to find a continuous route through every vertex, starting and finishing at vertex A, with the least total weight.

Use an appropriate algorithm to find a lower bound for the total weight of Sasha’s route.

Use the Nearest Neighbour Algorithm, starting at vertex A, to find an upper bound for

the total weight of Sasha’s route.

Sasha decides to use the route A - B - F - E - C - D - A.

Comment on the suitability of this route as a solution to Sasha’s problem.

Player 1 and player 2 are playing a two-person zero-sum game.

In each round of the game the players each choose a strategy and simultaneously reveal their choice.

The number of points won in each round by player 1 for each combination of strategies is shown in the table below.

Each player is trying to maximise the number of points that they win.

Determine play-safe strategies for each player.

Show that the game is not stable.

Show that the number of strategies available to player 1 cannot be reduced by dominance.

You must make it clear which values are being compared.