NZ Level 8 (NZC) Level 3 (NCEA) [In development]
topic badge
Forward and Backward Scanning

Interactive practice questions

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

Activity Dependencies Duration
$A$A - $2$2
$B$B $A$A $1$1
$C$C $A$A $5$5
$D$D $B$B $3$3
$E$E $D$D $7$7
$F$F $C,E$C,E $5$5

Vertex Start 1 2 3 4 Finish
EST $\editable{}$ $\editable{}$ $\editable{}$ $\editable{}$ $\editable{}$ $\editable{}$
Easy
Approx 3 minutes
Sign up to try all questions

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

Given the following network and activity table:

Given the following network and activity table:

Outcomes

M8-5

Develop network diagrams to find optimal solutions, including critical paths.

91576

Use critical path analysis in solving problems

What is Mathspace

About Mathspace