Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
Which is not a significant challenge of project scheduling?
a. | deadlines exist. | b. | activities are independent. | c. | many employees could
be required. | d. | delays are costly. |
|
|
|
2.
|
The critical path
a. | is any path that goes from the starting node to the completion
node. | b. | is a combination of all paths. | c. | is the shortest path. | d. | is the longest
path. |
|
|
|
3.
|
The earliest start time rule
a. | compares the starting times of all activities for successors of an
activity. | b. | compares the finish times for all immediate predecessors of an
activity. | c. | determines when the project can begin. | d. | determines when the project must
begin. |
|
|
|
4.
|
Activities G, P, and R are the immediate predecessors for activity W. If the
earliest finish times for the three are 12, 15, and 10, then the earliest start time for W
a. | is 10. | b. | is 12. | c. | is
15. | d. | cannot be determined. |
|
|
|
5.
|
Activities K, M and S immediately follow activity H, and their latest start
times are 14, 18, and 11. The latest finish time for activity H
a. | is 11. | b. | is 14. | c. | is
18. | d. | cannot be determined. |
|
|
|
6.
|
When activity times are uncertain,
a. | assume they are normally distributed. | b. | calculate the expected time, using (a + 4m +
b)/6. | c. | use the most likely time. | d. | calculate the expected time, using (a + m +
b)/3. |
|
|
|
7.
|
To determine how to crash activity times
a. | normal activity costs and costs under maximum crashing must be
known. | b. | shortest times with crashing must be known. | c. | realize that new
paths may become critical. | d. | All of the alternatives are
true. |
|
|
|
8.
|
In deciding which activities to crash, one must
a. | crash all critical activities. | b. | crash largest-duration
activities. | c. | crash lowest-cost activities. | d. | crash activities on the critical path(s)
only. |
|
|
|
9.
|
For an activity with more than one immediate predecessor activity, which of the
following is used to compute its earliest finish (EF) time?
a. | the largest EF among the immediate predecessors. | b. | the average EF among
the immediate predecessors. | c. | the largest LF among the immediate
predecessors. | d. | the difference in EF among the immediate
predecessors. |
|
|
|
10.
|
Which of the following is a general rule for crashing activities?
a. | Crash only non-critical activities. | b. | Crash activities with zero
slack. | c. | Crash activities with the greatest number of predecessors. | d. | Crash the path with
the fewest activities. |
|