START READING FROM 12)B. AND READ 12)A.

ATLAST

12)A. CRITICAL PATH METHOD (CPM) & PROJECT EVALUATION AND REVIEW TECHNIQUE (PERT) (16 M)
 END OF 12)A.

12)B. NETWORK DIAGRAM RULES / GRAPHICAL GUIDELINES FOR NEWORK (16 M)

 END OF 12)B.

12)C. NUMBERING THE EVENTS (8 M)

END OF 12)C.
12)D. DRAW A NETWORK DIAGRAM (WHEN BOTH EVENT AND ACTIVITY IS GIVEN) (16 M)

Note: EVENT NUMBER MUST BE INSIDE THE CIRCLE AND THE ACTIVITY WILL HAPPEN IN BETWEEN THE
EVENTS.

END OF 12)D.

12)E. DRAW A NETWORK DIAGRAM (WHEN ONLY THE ACTIVITY IS GIVEN ALONG WITH IT’S
PREDECESSOR) (16 M)
Note: WHEN THE EVENT NUMBERS ARE NOT GIVEN, CONSTRUCT THE NETWORK DIAGRAM WITH THE
ACTIVITIES AND NUMBER THE EVENTS BY YOURSELVES STARTING FROM 1.

2 4

6
1

3 5
3

A DUMMY ACTIVITY HAS TO BE ADDED AS BOTH C AND D HAVE A AS PREDECESSOR.

SOME COMMONLY MADE ERRORS FOR THE ABOVE QUESTION

A NETWORK DIAGRAM CANNOT START WITH

TWO EVENTS. IT HAS TO BEGIN AND END
WITH A SINGLE EVENT

IT VIOLATES THE RULE THAT, NO TWO

ACTIVITIES CAN BEGIN AND END AT THE
SAME EVENT.

END OF 12)E.
12)F. DRAW A NETWORK DIAGRAM (WHEN ONLY THE ACTIVITY IS GIVEN ALONG WITH IT’S
PREDECESSOR) (16 M)

END OF 12)F.

12)G. PLANNING FOR NETWORK CONSTRUCTION (8 M)

 END OF 12)G.

12)H. MODELS OF NETWORK CONSTRUCTION (8 M)

Note : IN INDIAN CONTEXT WE USUALLY WORK ON ACTIVITY ON ARROW (AOA) NERWORK

END OF 12)H.
12)I. WORK BREAKDOEN STRUCTURE (8 M)

END OF 12)I.
PROBLEMS

12)J. PREPARING NETWORK DIAGRAM (16 M)

IF THERE IS A QUESTION LIKE THIS FOR

PREPARING THE NETWORK DIAGRAM, FIRST
REARRANGE THE SEQUENCE PROPERLY (FOR
YOUR UNDERSTANDING) FOLLOWING THE
ACTIVITY ANNOTATIONS (A,B,C,D,E,F,G,H,I)

1) (vii) A and B start at the same time

2) (v) D follows A
3) (iv) E follows A but precedes I
4) (ii) C follows B but precedes H
5) (i) C follows D but precedes F
6) (iii) G follows F but precedes I
7) (vi) H and I terminate at the same time

Note: THIS ONE DIAGRAM WILL GET YOU 16 MARKS, PROVIDED YOU TAKE TIME AND UNDERSTAND
THE QUESTION AND DRAW THIS PROPERLY.

END OF 12)J.
CRITICAL PATH METHOD PROBLEMS

BEFORE GETTING ON TO THE CPM PROBLEMS , LEARN SOME DEFENITIONS

(WHICH MIGHT COME FOR 2 MARKS AS WELL)

12)K. DRAW NETWORK DIAGRAM, FIND EARLIEST EXPECTED TIME (TE), LATEST ALLOWABLE
OCCURANCE TIME (TL), TOTAL FLOAT (TF) AND DETERMINE THE CRITICAL PATH (16 M)

STEP 1 : DRAW THE NETWORK DIAGRAM WITH THE ACTIVITIES AND THE PRECEDING ACTIVITY, THE
EVENTS, WITHOUT CONSIDERING THE DURATION
STEP 2 : ADD THE DURATION TO THE NETWORK DIAGRAM

STEP 3 : IDENTIFY ALL THE PATHS FROM THE FIRST EVENT TO THE LAST EVENT
STEP 4 : CALCULATE AND WRITE THE
EARLIEST EVENT TIME (TE) – FORWARD PASS (STARTING FROM FIRST EVENT AND ADD THE DURATION
OF THE NEXT EVENT)

STEP 5 : WRITE THE EARLIEST EVENT TIME (TE) – START AND FINISH FOR EACH ACTIVITY IN THE
TABULAR COLUMN

Note : IF A ACTIVITY GOT TWO OR MORE

DIFFERENT EARLIEST EVENT TIME (TE) –
START AND FINISH, WRITE DOWN THE
HIGHER VALUE.

FOR EXAMPLE EVENT 9 TO 11 (ACTIVITY

“J”) HAS GOT TWO DIFFERENT START AND
FINISH VALUE, ON WHICH THE HIGHER
VALUE IS TAKEN.
STEP 6 : CALCULATE AND WRITE THE
LATEST ALLOWABLE OCCURANCE TIME (TL) – BACKWARD PASS (STARTING FROM LAST EVENT AND
SUBTRACT THE DURATION OF THE PREVIOUS EVENT)

Note : CONSIDER THE HIGHEST VALUE FOR THE LAST EVENT (42 WEEKS)

STEP 7 : WRITE THE LATEST ALLOWABLE OCCURANCE TIME (TL) – START AND FINISH FOR EACH
ACTIVITY IN THE TABULAR COLUMN

Note : IF A ACTIVITY GOT

TWO OR MORE DIFFERENT
LATEST ALLOWABLE
OCCURANCE TIME (TL) –
START AND FINISH, WRITE
DOWN THE LOWER VALUE.

FOR EXAMPLE ACTIVITY “A”

& “C” HAS GOT TWO OR
MORE DIFFERENT START
AND FINISH VALUE, ON
WHICH THE LOWER VALUE IS
TAKEN.
STEP 8 : CALCULATE THE TOTAL FLOAT (TF) AND INCLUDE IN THE TABULAR COLUMN
TF = LS – ES
TE TL
ES EF LS LF TF

STEP 9 : MARK THE “EF” AND “LF” VALUES IN THE NETWORK DIAGRAM
 STEP 10 : DETERMINE THE CRITICAL PATH.
OF ALL THE PATHS FROM THE FIRST EVENT TO THE LAST EVENT, THE PATH WHICH TAKES THE
MAXIMUM DURATION IS THE CRITICAL PATH.

36 WEEKS
PATH 1

36 WEEKS
PATH 2

36 WEEKS
PATH 3

42 WEEKS
PATH 4

THE CRITICAL PATH IS PATH 4 = A – C – F – H –J (42 WEEKS)

END OF 12)K.