ISDS 3115 EXAMS 2 ALL ANSWERS AND QUESTIONS
SET A+
✔✔six steps of PERT and CPM - ✔✔1. define the project and prepare the work
breakdown structure
2. develop relationships among the activities - decide which activities must precede and
which must follow orders
3. draw the network connecting all of the activities
4. assign time and or cost estimates to each activity
5. compute the longest time path through the network - this is called the critical path (the
one that will determine how long the project will take)
6. use the network to help plan, schedule, monitor, and control the project
✔✔questions PERT and CPM can answer - ✔✔1. when will the entire project be
completed?
2. what are the critical activities or tasks in the project?
3. which are the noncritical activities?
4. what is the probability the project will be completed by a specific date?
✔✔AON networks conventions - ✔✔always draw arrows at either straight horizontal or
at a 45 degree angle, never up and down
an arrow from one activity to the next means you have to be done with the first activity
before you can begin the next
✔✔performing a critical path analysis - ✔✔the critical path is the longest path through
the network
, the critical path is the shortest time in which the project can be completed
any delay in the critical path activities delays the project
critical path activities have no slack time
✔✔performing a critical path analysis: earliest start (ES) - ✔✔earliest time at which an
activity can start, assuming all predecessors have been completed
✔✔performing a critical path analysis: earliest finish (EF) - ✔✔earliest time at which an
activity can be finished
✔✔performing a critical path analysis: latest start (LS) - ✔✔latest time at which an
activity can start so as to not delay the completion of the entire project
✔✔performing a critical path analysis: latest finish (LF) - ✔✔latest time by which an
activity has to be finished so as to not delay the completion time of the entire project
✔✔forward pass - ✔✔begin at starting event and work forward
✔✔earliest start time rule - ✔✔- if an activity has only a single immediate predecessor,
its ES equals the EF of the predecessor
- if an activity has multiple immediate predecessors, its ES is the maximum of all the EF
values of its predecessors
when you have multiple arrows pulling into the same spot, you have to pick whichever
arrow is longest, picking the largest of the available times to make your estimate
✔✔earliest finish time rule - ✔✔the earliest finish time (EF) of an activity is the sum of its
earliest start time (ES) and its activity time
EF = ES + Activity time
✔✔backward pass - ✔✔begin with the last event and work backwards
✔✔latest finish time rule - ✔✔if an activity is an immediate predecessor for just a single
activity, its LF equals the LS of the activity that immediately follows it
if an activity is an immediate predecessor to more than one activity, its LF is the
minimum of all LS values of all activities that immediately follow it
LF = Min { LS of all immediate following activities}
SET A+
✔✔six steps of PERT and CPM - ✔✔1. define the project and prepare the work
breakdown structure
2. develop relationships among the activities - decide which activities must precede and
which must follow orders
3. draw the network connecting all of the activities
4. assign time and or cost estimates to each activity
5. compute the longest time path through the network - this is called the critical path (the
one that will determine how long the project will take)
6. use the network to help plan, schedule, monitor, and control the project
✔✔questions PERT and CPM can answer - ✔✔1. when will the entire project be
completed?
2. what are the critical activities or tasks in the project?
3. which are the noncritical activities?
4. what is the probability the project will be completed by a specific date?
✔✔AON networks conventions - ✔✔always draw arrows at either straight horizontal or
at a 45 degree angle, never up and down
an arrow from one activity to the next means you have to be done with the first activity
before you can begin the next
✔✔performing a critical path analysis - ✔✔the critical path is the longest path through
the network
, the critical path is the shortest time in which the project can be completed
any delay in the critical path activities delays the project
critical path activities have no slack time
✔✔performing a critical path analysis: earliest start (ES) - ✔✔earliest time at which an
activity can start, assuming all predecessors have been completed
✔✔performing a critical path analysis: earliest finish (EF) - ✔✔earliest time at which an
activity can be finished
✔✔performing a critical path analysis: latest start (LS) - ✔✔latest time at which an
activity can start so as to not delay the completion of the entire project
✔✔performing a critical path analysis: latest finish (LF) - ✔✔latest time by which an
activity has to be finished so as to not delay the completion time of the entire project
✔✔forward pass - ✔✔begin at starting event and work forward
✔✔earliest start time rule - ✔✔- if an activity has only a single immediate predecessor,
its ES equals the EF of the predecessor
- if an activity has multiple immediate predecessors, its ES is the maximum of all the EF
values of its predecessors
when you have multiple arrows pulling into the same spot, you have to pick whichever
arrow is longest, picking the largest of the available times to make your estimate
✔✔earliest finish time rule - ✔✔the earliest finish time (EF) of an activity is the sum of its
earliest start time (ES) and its activity time
EF = ES + Activity time
✔✔backward pass - ✔✔begin with the last event and work backwards
✔✔latest finish time rule - ✔✔if an activity is an immediate predecessor for just a single
activity, its LF equals the LS of the activity that immediately follows it
if an activity is an immediate predecessor to more than one activity, its LF is the
minimum of all LS values of all activities that immediately follow it
LF = Min { LS of all immediate following activities}
