978-1119165354 Test Bank Chapter 12

subject Type Homework Help
subject Pages 4
subject Words 740
subject Authors Harold Kerzner

Unlock document.

This document is partially blurred.
Unlock all pages and 1 million more documents.
Get Access
page-pf1
CHAPTER 12: NETWORK SCHEDULING TECHNIQUES
(Difficulty: E = easy, M = medium, H = hard)
(E) 1. Which of the following scheduling techniques is most appropriate today for managing
a project?
A. BAR charts
(E) 2. Which of the following scheduling techniques is most appropriate today for reporting
project status to a customer during an interchange meeting?
D. Precedence charts
(M) 3. The major disadvantage of using a bar chart on large projects is that bar charts:
D. Cannot show slack
(E) 4. Which of the following is not one of the four network diagramming techniques?
A. PERT
(H) 5. Which of the following activity-on-arrow network diagramming methods does not
require three estimates for durations??
(M) 6. Which of the following network diagramming methods do not use dummy activities?
A. PERT
page-pf2
(M) 7. Which of the following network diagramming methods allows for branching and
looping?
(M) 8. Which of the following is an activity-on-node network diagramming method?
A. PERT
(H) 9. Which of the following cannot be determined after performing a forward pass and a
backward pass on a network diagram?
A. The critical path
(H) 10. Negative slack is the result of:
D. All of the above
(M) 11. Activities with zero time durations are called:
(H) 12. Which of the following is false concerning the critical path in a network?
A. It is the longest path in the network.
page-pf3
(M) 13. The critical path is the path in the network with the greatest amount of risk.
(E) 14. If the optimistic time for an activity is 6 weeks, the pessimistic time is 24 weeks and
the most likely time is 12 weeks, then the expected duration is:
(E) 15. Which of the following schedule compression techniques usually requires adding more
resources to each work package that is being compressed?
(M) 16. In which of the following schedule compression techniques is the cost of rework
usually the greatest?
A. Overtime
(M) 17. Which of the following schedule compression techniques is often the lowest risk and
with the added benefit of lowering the cost?
A. Crashing
D. Slack utilization planning
(E) 19. Laying out a network diagram when you know before-hand the size of the available
resource pool is called:
A. Resource leveling
page-pf4
(E) 20. An activity in a network has the following characteristics: ES = 5, EF = 9, and LF =
12. LS = _____.
A. 5
(E) 21. An activity in a network has the following characteristics: ES = 10, EF = 18, and LS =
12. The duration of the activity is:
D. Cannot be determined
(M) 22. If the slack in a 12 12-week activity is 6 weeks and ES = 4, then LF = _____.
A. 4
(M) 23. The measurement of lag is made within an activity whereas slack is measured between
activities.
(M) 24. A PERT network reflects what type of precedence diagram?
A. Start-to-start
(E) 25. What are the maximum number of inputs and outputs that can exist in a node in the
precedence diagramming method?

Trusted by Thousands of
Students

Here are what students say about us.

Copyright ©2022 All rights reserved. | CoursePaper is not sponsored or endorsed by any college or university.