ACTUAL 2025 AQA AS FURTHER MATHEMATICS Paper 2 Discrete Question Paper
& Mark Scheme (Merged) Friday 16 May 2025 [VERIFIED]
, 2
Do not write
outside the
Answer all questions in the spaces provided. bo
x
1 A student is solving a network flow problem involving water pipes.
They have correctly found a flow through the network of 36 m3 s–1
They have correctly found a cut of the network with value 36 m3 s–1
Which one of the following is correct?
Tick (🗸) one box.
[1
mark]
The maximum flow through the network is less than 36 m3 s–1
The maximum flow through the network is equal to 36 m3 s–1
The maximum flow through the network is greater than 36 m3 s–1
It is not possible to make a conclusion about the maximum flow
through the network.
tyrionpapers.com
G/Jun25/7366/2D
, 3
Do not write
outside the
2 A simple‑connected graph has n vertices, where n ≥ 2 box
State the minimum number of edges of the graph.
Circle your answer.
[1 mark]
n(n – 1)
n–1 n n+1
2
Turn over for the next question
Turn over U
tyrionpapers.com
G/Jun25/7366/2D
& Mark Scheme (Merged) Friday 16 May 2025 [VERIFIED]
, 2
Do not write
outside the
Answer all questions in the spaces provided. bo
x
1 A student is solving a network flow problem involving water pipes.
They have correctly found a flow through the network of 36 m3 s–1
They have correctly found a cut of the network with value 36 m3 s–1
Which one of the following is correct?
Tick (🗸) one box.
[1
mark]
The maximum flow through the network is less than 36 m3 s–1
The maximum flow through the network is equal to 36 m3 s–1
The maximum flow through the network is greater than 36 m3 s–1
It is not possible to make a conclusion about the maximum flow
through the network.
tyrionpapers.com
G/Jun25/7366/2D
, 3
Do not write
outside the
2 A simple‑connected graph has n vertices, where n ≥ 2 box
State the minimum number of edges of the graph.
Circle your answer.
[1 mark]
n(n – 1)
n–1 n n+1
2
Turn over for the next question
Turn over U
tyrionpapers.com
G/Jun25/7366/2D
