Activity Predecessor Time(weeks)

A - 4

B A 5
C A 4
D B 6
E C 6

F D 5
G E 7

H G 4

Answer:

5 6 5

4
B D F

4
C 6
7 4
E G H

1- From this network diagram the critical path is A-C-E-G-H. This is the longest path with
total time in weeks = 25 weeks.
 4 9 9 15 15 20
0 4
B D F
A
4 9 9 15
15 20
0 4

4 8 8 14 14 21 25
21
C E G H
4 8 8 14 14 21 21 25

ES EF Ls LF Slack
0 4 4 0 4
4 9 4 9 0
4 8 4 8 0
9 15 9 15 0
8 14 8 14 0
15 20 15 20 0
14 21 14 21 0
21 25 21 25 0

1- This shows that there is no slack in this network time. So the longest path is the critical path.