topic badge

9.09 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
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

Given the following network and activity table:

Medium
2min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

MS2-12-8

solves problems using networks to model decision-making in practical problems

What is Mathspace

About Mathspace