ASSIGNMENT-3

1. DRAW A NET WORK DIAGRAM OF ACTIVITIES FOR PROJECT.

Activity Predecessor
activity
A -
B A
C A
D B
E B,C
F E
G D,F
H G

2. CONSTRUCT CPM NETWORK AND COMPUTE.

Activity 1-2 1-3 2-4 3-4 3-5 4-9 5-6 5-7 6-8 7-8 8-9 8-10 9-10
Time in 4 1 1 1 6 5 4 8 1 2 1 8 7
weeks

1. Total Float & Free Float for each activity

2. Critical path and its duration.

3. DRAW THE NETWORK DIAGRAM

ACTIVITY 1-2 1-3 2-3 2-4 3-4 4-3

DURATION 20 25 10 12 6 10

4. DRAW THE NETWORK DIAGRAM

Activity Duration

1-2 2
1-3 2
1-4 1
2-6 4
3-7 5
3-5 8
4-5 3
5-9 5
 6-8 1
7-8 4
8-9 3

5.Problem-: for the project represented by the network diagram, find the earliest time and
latest times to reach each node given the following data.
TASK A B C D E F G H I J K
LEAST TIME 4 5 8 2 4 6 8 5 3 5 6
GREATEST 8 10 12 7 10 15 16 9 7 11 13
TIME
MOST LIKELY 5 7 11 3 7 9 12 6 5 8 9
TIME

5. Problem: solve by PERT & calculate the S.D and Variance

TASK A B C D E F G H I J K
LEAST TIME 4 5 8 2 4 6 8 5 3 5 6
GREATEST 8 10 12 7 10 15 16 9 7 11 13
TIME
MOST LIKELY 5 7 11 3 7 9 12 6 5 8 9
TIME
Estimation Time 5.3 7.2 10.7 3.5 7 9.5 12 6.3 5 8 9.2

6. Problem: solve by PERT & calculate the S.D and Variance

ACTIVITY 1-2 2-3 2-4 3-5 4-5 4-6 5-7 6-7 7-8 7-9 8-10 9-10
MOST 1 1 1 3 2 3 4 6 2 5 1 3
OPTEMESTI
TIME(a)
MOAST 5 3 5 5 4 7 6 8 6 8 3 7
PESSIMESTIC
TIME(b)
MOST LIKELY 1.5 2 3 4 3 5 5 7 4 6 2 5
TIME(m)