00:01
Hello students for the given problem we are provided with the project network and critical path.
00:06
So first we need to calculate the expected duration which is denoted by te which is equal to a plus 4m plus b divided by 6 and variance for each activity using the provided optimistic alpha that is most likely m and pessimistic b time estimate.
00:25
So variance equal to b minus a the whole square upon 32.
00:28
Now we will use the provided data to calculate it.
00:32
So te is equal to 114 upon 6 which is equal to 9.
00:42
Next we need to construct the project network diagram with the code representing the activity and directed edges representing the sequence.
00:51
Next we need to perform the forward pass to calculate the earliest start that is easiest and earliest finish.
00:58
So for activity 1 to 4 earliest start is equal to 0 and earliest finish is equal to te which is equal to 9.
01:09
For subsequent activity es that is early start of the current activity is the ef of the deciding activity and ef is es plus te.
01:22
So performing the backward pass to calculate the latest start and latest finish time for each activity.
01:27
So for last activity 5 to 6 lf is equal to ef and ls is equal to lf minus te.
01:39
Now we will calculate the slack time.
01:45
Slow slack is equal to ls minus es and slack is also equal to lf minus ef...