Question

tual code de a Activity Predecessor Normal time A 2 B 3 C B A С 5 G. F H 15 HH 2 D И N M, J 1

Answer 1

1. Early Start, Early Finish, Latest Start, Latest Finish (For Calculation, Refer To The Below AON Diagram)

Activity	Predecessor	Duration	ES	EF	LS	LF
A	-	2	0	2	0	2
B	-	3	0	3	0	3
C	B	1	4	5	4	5
D	A	2	3	5	9	11
E	A	1	3	4	3	4
F	C	5	6	11	6	11
G	F	3	12	15	12	15
H	G,D	12	16	28	16	28
I	G	7	16	23	16	23
J	I	2	24	26	24	26
K	D	7	6	13	12	19
L	K	1	14	15	20	21
M	L	4	16	20	22	26
N	J	3	27	30	27	30
O	M,J	1	27	28	27	28

2. Activity on Arrow

ES Act EF SL SL ES=EF of Predessor+1 EF=ES+Dur LSELF-Dur LFƏLS of Successor-1 SL=LS-ES; LF-EF LS Dur LF 16 M20 0 A 2 3D 5 6 6 9 2 11 6 K 13 6 6 12 7 19 14 15 6 6 20 121 6 6 26 0 0 22 4 0 2 2 3 E4 0 0 31 4 16 H28 0 0 16 1228 270 28 0 0 27 128 0 4 11 161 23 C 5 0 B3 0 3 3 0 24 J 26 0 0 6 F 0 6 5 0 12 G 15 0 0 12 3 15 0 0 0 0 27 N30 0 0 27 3 30 4 1 5 11 16 7 23 24 2 26
3. Activity On Node

K L D 12 13 14 A 4 M 1 D A 15 5 00 J H B 2. с F H 3 J 6 7 11 9 10
4. Slack Of Activities (Refer To The Above AON Diagram for Calculation)

Activity	Predecessor	Duration	SL
A	-	2	0
B	-	3	0
C	B	1	0
D	A	2	6
E	A	1	0
F	C	5	0
G	F	3	0
H	G,D	12	0
I	G	7	0
J	I	2	0
K	D	7	6
L	K	1	6
M	L	4	6
N	J	3	0
O	M,J	1	0

5. Critical Paths

Critical Paths are highlighted in the AON diagram in red color. The paths are shown below. (Critial path is the chain with the least float, typically zero float).

Path A-E

Path B-C-F-G-I-J-N