1. Determine the critical path and project duration for the following activity.

Activity/Task A B C D E F G H
Predecessor - A A B C C D,E F,G
Duration(days) 3 4 2 5 1 2 4 3
Solution:

A B D G H ⇒ 3+4+5+4+3 =19
A C E G H ⇒ 3+2+1+4+3 =13
A C F H ⇒ 3+2+2+3 = 10
Maximum value indicates is the project duration.
Project duration = 19 (ans)
Critical path: A B D G H
2. Calculate the total float (total slack) and free float (free slack) for the following
activity of a project.
Activity/Task A B C D E F
Predecessor - A A B C D,E
Duration(days) 3 4 2 5 1 2
Solution:

Total float (total slack) for activity A, TF = LF – EF = 5 – 5 = 0

Or, = LS – ES = 0 – 0 = 0
Total float (total slack) for activity B, TF = LF – EF = 9 – 9 = 0
Or, = LS – ES =5 – 5 = 0
All of them are same formula & process.
 Free float (free slack) for activity A, FF =
=5–0–5=0
For activity B, FF = 9 – 5 – 4 = 0
All of them are same formula & process only last activity differents.
FF ≤ TF
TF of activity F is zero. FF of activity is must be zero.
3. Determine the earliest start and latest final for the following activity of a project.
Activity/Task A B C D E F
Predecessor - A A B C D,E
Duration(days) 3 4 2 5 1 2
Solution:

4. Construct the project network, perform forward and backward passes,

determine the project completion, calculate the slack values and state the critical
path.
Activity/Task A B C D E F G
Immediate - A A A,B D C,E E
Predecessors
Expected 7 9 12 8 9 6 5
time (weeks)