Calculate early and late times

A question is this type if and only if it asks you to perform forward and backward passes to find early event times and late event times on a given or constructed network.

26 questions · Moderate -0.4

7.05a Critical path analysis: activity on arc networks7.05b Forward and backward pass: earliest/latest times, critical activities
Sort by: Default | Easiest first | Hardest first
AQA Further AS Paper 2 Discrete 2024 June Q9
6 marks Standard +0.3
Robert, a project manager, and his team of builders are working on a small building project. Robert has divided the project into ten activities labelled \(A\), \(B\), \(C\), \(D\), \(E\), \(F\), \(G\), \(H\), \(I\) and \(J\) as shown in the precedence table below:
ActivityImmediate Predecessor(s)Duration (Days)
\(A\)None1
\(B\)None1
\(C\)\(A\)10
\(D\)\(A\)2
\(E\)\(B, D\)5
\(F\)\(E\)6
\(G\)\(E\)1
\(H\)\(F\)1
\(I\)\(F\)2
\(J\)\(C, G, H, I\)4
  1. On the opposite page, construct an activity network for the project and fill in the earliest start time and latest finish time for each activity. [4 marks]
  2. Robert claims that the project can be completed in 20 days. Comment on the validity of Robert's claim. [2 marks]