| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2001 |
| Session | June |
| Marks | 5 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Critical Path Analysis |
| Type | Draw activity network from table |
| Difficulty | Easy -1.3 This is a straightforward application of a standard D1 algorithm requiring only direct translation of a precedence table into an activity network diagram. No problem-solving, optimization, or novel insight is needed—just mechanical application of learned rules for drawing activity-on-arc networks, making it easier than average. |
| Spec | 7.05a Critical path analysis: activity on arc networks |
| Activity | Preceding Activities |
| \(A\) | - |
| \(B\) | - |
| \(C\) | - |
| \(D\) | \(B\) |
| \(E\) | \(A\) |
| \(F\) | \(A\) |
| \(G\) | \(B\) |
| \(H\) | \(C , D\) |
| \(I\) | \(E\) |
| \(J\) | \(E\) |
| \(K\) | \(F , G , I\) |
| \(L\) | \(H , J , K\) |
\begin{enumerate}
\item The precedence table for activities involved in a small project is shown below
\end{enumerate}
\begin{center}
\begin{tabular}{ | c | c | }
\hline
Activity & Preceding Activities \\
\hline
$A$ & - \\
\hline
$B$ & - \\
\hline
$C$ & - \\
\hline
$D$ & $B$ \\
\hline
$E$ & $A$ \\
\hline
$F$ & $A$ \\
\hline
$G$ & $B$ \\
\hline
$H$ & $C , D$ \\
\hline
$I$ & $E$ \\
\hline
$J$ & $E$ \\
\hline
$K$ & $F , G , I$ \\
\hline
$L$ & $H , J , K$ \\
\hline
\end{tabular}
\end{center}
Draw an activity network, using activity on edge and without using dummies, to model this project.\\
(5)\\
\hfill \mbox{\textit{Edexcel D1 2001 Q1 [5]}}