A project involves 11 activities, \(A\) to \(K\).
The table below shows the earliest start time and duration, in days, for each activity.
The immediate predecessor(s) of each activity is also shown.
\begin{array} {|c|c|c|}
\hline
\rule{0pt}{2.5ex} \ \ \textbf{Activity}\ \ & \textbf{Earliest} & \ \ \textbf{Duration}\ \ & \textbf{Immediate}\\
& \textbf{start time} \rule[-1ex]{0pt}{0pt} & &\textbf{predecessor}\\
\hline
\rule{0pt}{2.5ex} A \rule[-1ex]{0pt}{0pt} & \text{0} & \text{6} & \text{-}\\
\hline
\rule{0pt}{2.5ex} B \rule[-1ex]{0pt}{0pt} & \text{0} & \text{7} & \text{-}\\
\hline
\rule{0pt}{2.5ex} C \rule[-1ex]{0pt}{0pt} & \text{6} & \text{10} & A\\
\hline
\rule{0pt}{2.5ex} D \rule[-1ex]{0pt}{0pt} & \text{6} & \text{7} & A\\
\hline
\rule{0pt}{2.5ex} E \rule[-1ex]{0pt}{0pt} & \text{7} & \text{8} & B\\
\hline
\rule{0pt}{2.5ex} F \rule[-1ex]{0pt}{0pt} & \text{15} & \text{2} & D,\ E\\
\hline
\rule{0pt}{2.5ex} G \rule[-1ex]{0pt}{0pt} & \text{15} & \text{2} & E\\
\hline
\rule{0pt}{2.5ex} H \rule[-1ex]{0pt}{0pt} & \text{17} & \text{3} & G\\
\hline
\rule{0pt}{2.5ex} I \rule[-1ex]{0pt}{0pt} & \text{20} & \text{6} & C,\ F,\ H\\
\hline
\rule{0pt}{2.5ex} J \rule[-1ex]{0pt}{0pt} & \text{17} & \text{5} & G\\
\hline
\rule{0pt}{2.5ex} K \rule[-1ex]{0pt}{0pt} & \text{26} & \text{2} & I,\ J\\
\hline
\end{array}
Question 7
A directed network for this project will require a dummy activity.
The dummy activity will be drawn from the end of
- activity \(A\) to the start of activity \(D\).
- activity \(E\) to the start of activity \(F\).
- activity \(F\) to the start of activity \(I\).
- activity \(G\) to the start of activity \(H\).
- activity \(I\) to the start of activity \(J\).
Question 8
When this project is completed in the minimum time, the sum of all the float times, in days, will be
- 0
- 16
- 18
- 20
- 28