| Exam Board | AQA |
|---|---|
| Module | Further Paper 3 Discrete (Further Paper 3 Discrete) |
| Year | 2020 |
| Session | June |
| Marks | 1 |
| Paper | Download PDF ↗ |
| Topic | Network Flows |
| Type | Add supersource and/or supersink |
| Difficulty | Moderate -0.5 This is a straightforward conceptual question requiring students to identify source nodes (no incoming edges) and sink nodes (no outgoing edges) in a network flow diagram. While it's a Further Maths topic, it requires only pattern recognition and understanding of basic definitions rather than any calculation or problem-solving, making it easier than average. |
| Spec | 7.04a Shortest path: Dijkstra's algorithm |
| Supersource | Supersink |
| \(P , Q\) | \(U , V , W\) |
| \(U , V , W\) | \(P , Q\) |
| \(V , X\) | \(U , W\) |
| \(U , W\) | \(V , X\) |
1 The diagram below shows a network of pipes with their capacities.\\
\includegraphics[max width=\textwidth, alt={}, center]{c297a67f-65fd-47e0-a60c-d38fd86c6081-02_734_1275_630_386}
A supersource and a supersink will be added to the network.\\
To which nodes should the supersource and supersink be connected?\\
Tick $( \checkmark )$ one box.
\begin{center}
\begin{tabular}{|l|l|}
\hline
Supersource & Supersink \\
\hline
$P , Q$ & $U , V , W$ \\
\hline
$U , V , W$ & $P , Q$ \\
\hline
$V , X$ & $U , W$ \\
\hline
$U , W$ & $V , X$ \\
\hline
\end{tabular}
\end{center}
□\\
□\\
□\\
\includegraphics[max width=\textwidth, alt={}, center]{c297a67f-65fd-47e0-a60c-d38fd86c6081-02_118_113_2261_1324}
\hfill \mbox{\textit{AQA Further Paper 3 Discrete 2020 Q1 [1]}}