topic badge

7.03 Analysing tasks on a project network

Interactive practice questions

Given the following network and activity table find the earliest starting time (EST) for each vertex.

Activity Dependencies Duration
$A$A - $5$5
$B$B - $2$2
$C$C $A,B$A,B $3$3
$D$D $A,B$A,B $4$4
$E$E $C$C $5$5
$F$F $C$C $6$6
$G$G $D,E,F$D,E,F $7$7
$H$H $G$G $3$3

Vertex Start 1 2 3 4 Finish
EST $\editable{}$ $\editable{}$ $\editable{}$ $\editable{}$ $\editable{}$ $\editable{}$
Easy
1min

Given the following network and activity table find the earliest starting time (EST) for each vertex.

Easy
2min

Given the following network and activity table find the earliest starting time (EST) for each vertex.

Easy
1min

Given the following network and activity table:

Easy
6min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

4.3.5

use forward and backward scanning to determine the earliest starting time (EST) and latest starting times (LST) for each activity in the project

4.3.6

use ESTs and LSTs to locate the critical path(s) for the project

4.3.7

use the critical path to determine the minimum time for a project to be completed

4.3.8

calculate float times for non-critical activities

What is Mathspace

About Mathspace