CHAPTER 9: PROJECT SCHEDULING: PERT/CPM QUESTIONS AND
VERIFIED DETAILED SOLUTIONS ( MULTIPLE CHOICES) |100%
CORRECT!! ALREADY GRADED A+
Critical activities are those that can be delayed without delaying the entire project. (T/F) -
(ANSWER)FALSE
PERT and CPM are applicable only when there is no dependence among activities. (T/F) -
(ANSWER)FALSE
A path through a project network must reach every node. (T/F) - (ANSWER)FALSE
A critical activity can be part of a noncritical path. (T/F) - (ANSWER)TRUE
When activity times are uncertain, an activity's most likely time is the same as its expected time. (T/F) -
(ANSWER)FALSE
The earliest finish time for the final activity is the project duration. (T/F) - (ANSWER)TRUE
The length of time an activity can be delayed without affecting the project completion is the slack. (T/F) -
(ANSWER)TRUE
When activity times are uncertain, total project time is normally distributed with mean equal the sum of
the means of all of the critical activities. (T/F) - (ANSWER)TRUE
Crashing refers to an unanticipated delay in a critical path activity that causes the total time to exceed its
limit. (T/F) - (ANSWER)FALSE
Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish
time with the earliest finish time of each predecessor. (T/F) - (ANSWER)TRUE
The project manager should monitor the progress of any activity with a large time variance even if the
expected time does not identify the activity as a critical activity. (T/F) - (ANSWER)TRUE
, CHAPTER 9: PROJECT SCHEDULING: PERT/CPM QUESTIONS AND
VERIFIED DETAILED SOLUTIONS ( MULTIPLE CHOICES) |100%
CORRECT!! ALREADY GRADED A+
The variance in the project completion time is the sum of the variances of all activities in the project.
(T/F) - (ANSWER)FALSE
The latest finish time for an activity is the largest of the latest start times for all activities that
immediately follow the activity. (T/F) - (ANSWER)FALSE
The earliest start time for an activity is equal to the smallest of the earliest finish times for all its
immediate predecessors. (T/F) - (ANSWER)FALSE
The linear programming model for crashing presented in the textbook assumes that any portion of the
activity crash time can be achieved for a corresponding portion of the activity crashing cost. (T/F) -
(ANSWER)TRUE
All activities on a critical path have zero slack time. (T/F) - (ANSWER)TRUE
The difference between an activity's earliest finish time and the latest finish time equals the difference
between its earliest time and latest start time. (T/F) - (ANSWER)TRUE
It is possible to have more than one critical path at a time. (T/F) - (ANSWER)TRUE
Activities require time to complete while events do not. (T/F) - (ANSWER)TRUE
Precedence relationships among activities is critical in CPM analysis but not in PERT. (T/F) -
(ANSWER)FALSE
The normal distribution tends to be a better approximation of the distribution of total time for shorter
projects where the critical path has relatively few activities. (T/F) - (ANSWER)FALSE
VERIFIED DETAILED SOLUTIONS ( MULTIPLE CHOICES) |100%
CORRECT!! ALREADY GRADED A+
Critical activities are those that can be delayed without delaying the entire project. (T/F) -
(ANSWER)FALSE
PERT and CPM are applicable only when there is no dependence among activities. (T/F) -
(ANSWER)FALSE
A path through a project network must reach every node. (T/F) - (ANSWER)FALSE
A critical activity can be part of a noncritical path. (T/F) - (ANSWER)TRUE
When activity times are uncertain, an activity's most likely time is the same as its expected time. (T/F) -
(ANSWER)FALSE
The earliest finish time for the final activity is the project duration. (T/F) - (ANSWER)TRUE
The length of time an activity can be delayed without affecting the project completion is the slack. (T/F) -
(ANSWER)TRUE
When activity times are uncertain, total project time is normally distributed with mean equal the sum of
the means of all of the critical activities. (T/F) - (ANSWER)TRUE
Crashing refers to an unanticipated delay in a critical path activity that causes the total time to exceed its
limit. (T/F) - (ANSWER)FALSE
Constraints in the LP models for crashing decisions are required to compare the activity's earliest finish
time with the earliest finish time of each predecessor. (T/F) - (ANSWER)TRUE
The project manager should monitor the progress of any activity with a large time variance even if the
expected time does not identify the activity as a critical activity. (T/F) - (ANSWER)TRUE
, CHAPTER 9: PROJECT SCHEDULING: PERT/CPM QUESTIONS AND
VERIFIED DETAILED SOLUTIONS ( MULTIPLE CHOICES) |100%
CORRECT!! ALREADY GRADED A+
The variance in the project completion time is the sum of the variances of all activities in the project.
(T/F) - (ANSWER)FALSE
The latest finish time for an activity is the largest of the latest start times for all activities that
immediately follow the activity. (T/F) - (ANSWER)FALSE
The earliest start time for an activity is equal to the smallest of the earliest finish times for all its
immediate predecessors. (T/F) - (ANSWER)FALSE
The linear programming model for crashing presented in the textbook assumes that any portion of the
activity crash time can be achieved for a corresponding portion of the activity crashing cost. (T/F) -
(ANSWER)TRUE
All activities on a critical path have zero slack time. (T/F) - (ANSWER)TRUE
The difference between an activity's earliest finish time and the latest finish time equals the difference
between its earliest time and latest start time. (T/F) - (ANSWER)TRUE
It is possible to have more than one critical path at a time. (T/F) - (ANSWER)TRUE
Activities require time to complete while events do not. (T/F) - (ANSWER)TRUE
Precedence relationships among activities is critical in CPM analysis but not in PERT. (T/F) -
(ANSWER)FALSE
The normal distribution tends to be a better approximation of the distribution of total time for shorter
projects where the critical path has relatively few activities. (T/F) - (ANSWER)FALSE
