100% found this document useful (1 vote)
1K views11 pages

Network Diagram Exercises

The document provides 7 problem exercises involving constructing network diagrams from information about project activities and their time estimates and precedence relationships. Students are asked to draw the network diagrams, number events in sequence, identify critical paths, and calculate critical path lengths. The exercises involve a variety of multi-step projects to practice skills in network scheduling techniques.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
1K views11 pages

Network Diagram Exercises

The document provides 7 problem exercises involving constructing network diagrams from information about project activities and their time estimates and precedence relationships. Students are asked to draw the network diagrams, number events in sequence, identify critical paths, and calculate critical path lengths. The exercises involve a variety of multi-step projects to practice skills in network scheduling techniques.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

PROBLEM EXERCISES

PRESENTATION BY:
AJAY R. LAQUI
1. Number the events of the following networks in proper sequence.

2 4

1 6

3 5
2. Construct a network diagram from the following information :

Activity Precedes Estimated Time


(Weeks)
a b 15

b c,d 13

c e 8

d end 5

e end 3
3. Construct a network diagram from the following information :

Activity Precedes Estimated Time (Days)

f g, h 10

g i,j 10

h j 8

i end 6

j k 12

k end 7
4. From the following information, draw the CPM network and number the events in their
proper sequence.

• A, B and C are starting activities and may begin at the same time.
• D and E follows A and cannot start until A is completed.
• G follows and depends on C.
• F is dependent on the completion of B and D.
• G and F must be done before H can start.
• J also depends on G and F and it is an ending activity.
• I is also an ending activity but it cannot start until E and H are completed.
Activity Precedes
A D,E
B F
C G
D F
E I
F H,J
G H,J
H I
I end
J end
5. Draw the network diagram of the following information:
• A is the first job of the project.
• O and N are the two final job for the project completion.
• K precedes O.
• N follows L and M.
• J restricts the start of K and M.
• C and B depends on the completion of A.
• D follows B and may go on in parallel with C and E.
• E follows C
• I restricts the start of J and L
• H and G also restricts K and M.
• F must precede F and may go in parallel with H.
• E and D restrict H and I.
• C must precede F.
Activity Precedes
A C,B
B D
C E
D H,I
E H,I
F G
G K,M
H K,M
I J,L
J K,M
K O
L N
M N
N end
O end
6. Draw the following network:

a) G follows F but precede H.


b) G follows D but precede J.
c) M follows H but precede L.
d) K follows A but precede L.
e) F follows A.
f) A and D start at the same time.
g) J and L terminate at the same time.
Activity Precedes
G H,J
F G
H M
D G
J end
M L
L end
K L
A K,F
7. Using the following information, perform the following:
a) Network diagram
b) Determine which activities are on the critical path
c) Compute the length of the critical path

Activity Estimated Time (Days)


1-2 5
2-3 6
2-4 4
3-6 10
6-7 3
4-5 5
4-7 16
5-7 10

You might also like