9.09 Forward and backward scanning

For each of the following networks and activity table pairs, find the earliest starting time (EST) for each vertex:

a

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

b

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

For each of the following networks and activity table pairs, find the earliest starting time (EST) and latest starting time (LST) for each vertex:

a

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

b

Activity	Dependencies	Duration
A	-	5
B	-	6
C	-	4
D	A,B	7
E	C	2
F	C	3
G	D	1
H	E,F	5
I	H	8
J	G,I	9

For each of the following networks, find the earliest starting time (EST) and latest starting time (LST) for each vertex:

a

b

c

d