Question

Activity No.	Activity	Time (weeks)	Immediate Predecessors
1	Collect requirements	6
2	Analyze processes	2	1
3	Analyze data	4	2
4	Design processes	18	2
5	Design data	6	3
6	Design screens	6	3,4
7	Design reports	12	4,5
8	Program	10	6,7
9	Test and Document	14	7
10	Install	4	8,9

Construct a network diagram & calculate the earliest expected completion time/s

Answer 1

ACTIVITY	DURATION	ES	EF	LS	LF	SLACK
1	6	0	6	0	6	0
2	2	6	8	6	8	0
3	4	8	12	16	20	8
4	18	8	26	8	26	0
5	6	12	18	20	26	8
6	6	26	32	36	42	10
7	12	26	38	26	38	0
8	10	38	48	42	52	4
9	14	38	52	38	52	0
10	4	52	56	52	56	0

FORWARD PASS
We calculate the ES and EF values using a forward pass where the ES of an activity is the maximum EF of all the predecessor activities.

BACKWARD PASS
We calculate the LS and LF values using a backward pass where the LF of the activity is the minimum of all the successor activities.

SLACK
Slack is the value which is determined by subtracting EF from the LF or ES from the LS.

CRITICAL PATH
Critical path is the chain in the project network where the slack value of all the activities is 0, what this means is that any delay in these activities would result in delaying the entire project.

CRITICAL PATH = 1-2-4-7-9-10
DURATION OF PROJECT = 56