PROJECT MANAGEMENT TAKE HOME QUIZ

PROBLEM NO. 1. Natalie is the Project Manager for the Black Eyed Peas concert at the
Philippine Arena and she wants to determine the earliest possible time for her to finish preparing
for the event. There are nine (9) activities that should be executed to ensure the success of the
concert: processing of permits, organizing the team, book performers, reserve the venue,
schedule rehearsals, advertise, sell the tickets, subcontract staging and to conduct and evaluate
the concert.
Some activities, called precedents, need to be finished before the next activity can be started.
The precedent/s of Activity B is A, Activity C is B, Activity D is A, Activity E is C, Activity F is C,
Activity G are D and F, Activity H is D, and Activity I are E, G and H.
1) Given the aforementioned activities, construct a network diagram for this
project.
Fill up the Data Summary Table using the details given in the problem.
DESCRIPTION

ACTIVITY

Process permits
Organize team
Book performers
Reserve venue
Schedule rehearsals
Advertise
Sell Tickets
Subcontract staging
Conduct and Evaluate concert

A
B
C
D
E
F
G
H
I

PREDECESS
OR/S

2) Draw the project network while taking into consideration the predecessor/s of
each activity.
RULE 1: Activity A (which has no predecessor) shall start with Node 1 while Activity
I (which has no successor) shall end with the last node (Node 8).

RULE 2: An artificial activity (broken arrow) shall be drawn from Node 5 to Node 6
to satisfy the precedence of Activity G (which follows both Activity D and Activity
F) and Activity H (which follows Activity D only)

2. With the Black Eyed Peas Concert, Natalie was able to determine the following information:

to

ACTIVITY

tm

tp

te

(a)
(m)
(b)
A
4
6
9
B
1
2
3
C
6
8
10
D
4
6
12
E
5
9
11
F
2
4
7
G
1
4
12
H
3
6
8
I
2
5
7
Legend:
to = optimistic time (minimal time needed by an activity if everything is going fine)
tp = pessimistic time (maximum time needed by an activity if everything is going
bad)

tm = most likely time (time needed by an activity if everything is going in between

good and bad)
3) Find the expected time needed to complete each activity.
Step 1: Compute for te using the following formula:

te =

4m

Step 2: Assign the expected time (each activity) on your project network. (Use
the constructed network in #2)

4) Find the critical path. (Critical Path has the maximum time duration/cost value.)
STEP 1: Identify the possible path coming from Event 1 (Node 1) up to Event 8
(Node 8)
STEP 2: Sum up the total minimum time needed in passing through this path.
**The path which will use the maximum amount of time to finish the project is
the most critical among the available paths.
NETWORK I

NETWORK 2

NETWORK 3

CPM

5) Find the project Standard Deviation.

1. Compute for the variance value of all activities.

b -a

2. Compute for the Variance of the project (Sum of the variances of all critical
activities [along the critical path])
3. Get the SD by getting the square root of the total variance.

6) Find the probability that the project will be finished in 27 weeks.

1. Find for the Z-Score using the following formula:
Z Score =

Due Date Expected Date

Standard Deviation

2. Look for the probability value in the Standard Normal Distribution table.