| Exam Board | AQA |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2012 |
| Session | January |
| Marks | 14 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Network Flows |
| Type | Lower and upper capacity networks |
| Difficulty | Standard +0.3 This is a standard network flows question from Decision Mathematics covering routine algorithmic procedures (cut calculation, flow augmentation, max-flow min-cut theorem). While multi-part with several steps, it requires only methodical application of well-practiced algorithms rather than problem-solving insight, making it slightly easier than average A-level maths questions. |
| Spec | 7.04a Shortest path: Dijkstra's algorithm7.04b Minimum spanning tree: Prim's and Kruskal's algorithms7.04c Travelling salesman upper bound: nearest neighbour method7.04d Travelling salesman lower bound: using minimum spanning tree |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Cut \(Q\) passes through: \(AB\), \(BE\), \(DE\), \(DG\), \(FG\) | M1 | Identifying correct edges |
| Value \(= 10 + 6 + 13 + 3 + 7 = 39\) | A1 | cao |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(DE = 13\) | B1 | |
| \(FG = 6\) | B1 | Using conservation of flow |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Correct potential increases and decreases marked on Figure 3 | M1A1 | Must show (increase, decrease) pairs correctly for each arc |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Valid flow-augmenting path(s) found with extra flow stated | M1 | |
| Correct augmentation shown on diagram | A1 | |
| All paths and flows correct in table | A1A1 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Maximum flow \(= 39\) | B1 | cao |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Correct maximum flow shown on Figure 4 | M1A1 | All values correct and consistent |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Cut with capacity 39, e.g. \(\{AB, BE, DE, DG, FG\}\) | B1 | cao, must equal maximum flow value |
# Question 6:
## Part (a):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Cut $Q$ passes through: $AB$, $BE$, $DE$, $DG$, $FG$ | M1 | Identifying correct edges |
| Value $= 10 + 6 + 13 + 3 + 7 = 39$ | A1 | cao |
## Part (b)(i):
| Answer | Marks | Guidance |
|--------|-------|----------|
| $DE = 13$ | B1 | |
| $FG = 6$ | B1 | Using conservation of flow |
## Part (b)(ii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Correct potential increases and decreases marked on Figure 3 | M1A1 | Must show (increase, decrease) pairs correctly for each arc |
## Part (b)(iii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Valid flow-augmenting path(s) found with extra flow stated | M1 | |
| Correct augmentation shown on diagram | A1 | |
| All paths and flows correct in table | A1A1 | |
## Part (c)(i):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Maximum flow $= 39$ | B1 | cao |
## Part (c)(ii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Correct maximum flow shown on Figure 4 | M1A1 | All values correct and consistent |
## Part (d):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Cut with capacity 39, e.g. $\{AB, BE, DE, DG, FG\}$ | B1 | cao, must equal maximum flow value |
6 The network shows a system of pipes with the lower and upper capacities for each pipe in litres per second.\\
\includegraphics[max width=\textwidth, alt={}, center]{b23828c8-01ee-4b5a-b6d2-41b7e27190d6-14_807_1472_429_276}
\begin{enumerate}[label=(\alph*)]
\item Find the value of the cut $Q$.
\item Figure 2 shows most of the values of a feasible flow of 34 litres per second from $S$ to $T$.
\begin{enumerate}[label=(\roman*)]
\item Insert the missing values of the flows along $D E$ and $F G$ on Figure 2.
\item Using this feasible flow as the initial flow, indicate potential increases and decreases of the flow along each edge on Figure 3.
\item Use flow augmentation on Figure 3 to find the maximum flow from $S$ to $T$. You should indicate any flow-augmenting paths in the table and modify the potential increases and decreases of the flow on the network.
\end{enumerate}\item \begin{enumerate}[label=(\roman*)]
\item State the value of the maximum flow.
\item Illustrate your maximum flow on Figure 4.
\end{enumerate}\item Find a cut with capacity equal to that of the maximum flow.
\begin{figure}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\includegraphics[alt={},max width=\textwidth]{b23828c8-01ee-4b5a-b6d2-41b7e27190d6-15_1646_1463_280_381}
\end{center}
\end{figure}
Figure 3
\begin{figure}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Figure 4}
\includegraphics[alt={},max width=\textwidth]{b23828c8-01ee-4b5a-b6d2-41b7e27190d6-15_668_1230_1998_404}
\end{center}
\end{figure}
\end{enumerate}
\hfill \mbox{\textit{AQA D2 2012 Q6 [14]}}