1. The critical path is
a) The longest path
b) Is a combination of all paths
c) Is any path that goes from the starting node to the completion node
d) Is the shortest path
2. Activities with zero slack
a) Lie on a critical path
b) Have no predecessors
c) Must be completed first
d) Can be delayed
3. Which of the following is always true about critical activity?
a) LS=EF
b) EF=ES
c) ES=LS
d) LF=LS
4. Arcs in a project network indicate
a) Precedence relationship
b) Activities
c) The critical path
d) Completion times
5. The purpose of the forward pass in the critical path method technique is to
a) Review each of the precedence relationships in the activity network
b) To calculate the slack time with each node in the activity network
c) To determine the early time each activity can to finish
d) To determine the latest time each activity can finish
6. Activities F, 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 is?
a) 10
b) 12
c) 15
d) Cannot be determined
7. Only PERT’s bold assumption is that
a) Individual activity times are dependent on each other
b) Individual activity times can be added together
c) Individual activity times are constant
d) Individual activity times are uncertain
8. An activity has an Optimistic activity time of 3 days, a Most Probably activity time of 6
days, and a Pessimistic activity time of 9 days. The average expected time for activity is
a) 3
b) 5
c) 6
d) 9
9. Activities K, M, and S immediately follow H, and their latest start times are 14, 18, and
11. The latest finish time for activity H is?
a) 11
b) 14
c) 18
d) Cannot be determined
10. Only PERT’s bold assumption is that
a) Individual activity times can be added together
b) Individual activity times are uncertain
c) Individual activity times are constant
d) Individual activity times are dependent on each other
11. Decision makers is queuing situation attempts to balance
a) Service level against service cost
b) Operating characteristics against rival rate
c) The number of units in the system against the time in the system
d) The service rate against rival rates
12. Performance measures dealing with the number of units in the line and the time spent
waiting are called
a) System measures
b) Performance queues
c) Operating characteristics
d) Queuing facts
13. If the arrival occurs according to Poisson distribution every 20 minutes, then which is not
true?
a) Arrival rate is 20 arrivals per hour
b) Arrival rate is 3 arrivals per hour
c) Arrival rate is 1/20 per minute
d) Arrival rate is 72 per day
14. Which type of queuing system are you likely to encounter at a grocery store?
a) Single waiting line, single service station
b) Multiple waiting line, single service station
c) Multiple waiting line, multiple service station
d) Single waiting line, multiple service station
15. The number of arrivals to a store follows a Poisson with mean (lambda)= 12/hour. What
is the mean inter-arrival time?
a) 5 hours
b) 5 minutes
c) 12 minutes
d) 12 hours
16. Which of the following is the typical operating characteristics for average number of
units in a queue?
a) L
b) L q (the q is a small lowercase q in the next to bottom right of the L)
c) Wq (the q is a small lowercase q in the next to bottom right of the L)
d) W
17. In a waiting line situation, arrivals occur, on average, every 10 minutes, and 10 units can
be received every hour. What are λ and µ?
a) Λ=10, µ=10
b) Λ =10, µ =6
c) Λ=6, µ=6
d) Λ=6, µ =10
18. The arrival rate in queuing formulas is expressed as
a) The mean number of arrivals per channel
b) The mean number between arrivals
c) The mean number of arrivals per time period
d) The minimal number of arrival per time period
19. What queue discipline is assumed by the waiting line models presented in the textbook?
a) Last in first out
b) First come first serve
c) Shortest processing time first
d) No discipline is assumed
20. For many waiting line situation, the arrival occurs randomly and independently of other
arrivals and it has been found that good description of the arrival pattern is provided by
a) A Poisson probability distribution
b) An exponential probability distribution
c) A uniform probability distribution
d) A normal probability distribution
