Quiz
Note: It is recommended that you save your response as you
complete each question.
Question 1 (3 points)
The shortest-route technique would best be used to
__________.
Question 1 options:
minimize the amount of traffic flow on a busy highway.
determine the amount of LAN network wiring within a
building.
determine the path for a truck making frequent but
repeatable drops.
assign workers to jobs in the cheapest manner.
determine the number of units to ship from each source to
each destination.
Save
Question 2 (3 points)
If your goal was to construct a network in which all points
were connected and the distance between them was as short as possible, the
technique that you would use is __________.
Question 2 options:
maximal-flow
minimal-flow
shortest-route
minimal-spanning tree
shortest-spanning tree
Save
Question 3 (3 points)
A technique that allows a researcher to determine the
greatest amount of material that can move through a network is called
__________.
Question 3 options:
maximal-spanning
shortest-route
maximal-flow
maximal-tree
Save
Question 4 (3 points)
A point in the network that is at the beginning or end of a
route is called a(n) __________.
Question 4 options:
line
node
source
arc
branch
Save
Question 5 (3 points)
Assume that we are using a waiting line model to analyze the
number of service technicians required to maintain machines in a factory. Our
goal should be to:
Question 5 options:
minimize the downtime for individual machines.
minimize the percent of idle time of the technicians.
maximize productivity of the technicians.
minimize the number of machines needing repair.
minimize the total cost (cost of maintenance plus cost of
downtime).
Save
Question 6 (3 points)
Which of the following is not true about arrivals?
Question 6 options:
Service times often follow the negative exponential
distribution.
Random arrivals are independent of each other.
The Poisson distribution is often used to represent the
arrival pattern.
The exponential distribution is often used to represent the
arrival pattern.
Random arrivals cannot be predicted exactly.
Save
Question 7 (3 points)
The term queue “discipline” describes the:
Question 7 options:
All of the above are correct.
degree to which members of the queue renege.
sequence in which members of the queue are serviced.
sequence in which members of the queue arrived.
degree to which members of the queue are orderly and quiet.
Save
Question 8 (3 points)
In queuing analysis, total expected cost is the sum of
expected __________ plus expected __________.
Question 8 options:
service costs; waiting costs
service costs; arrival costs
calling costs; waiting costs
calling cost; inventory costs
facility costs; calling costs
Save
Question 9 (3 points)
The customer who arrives at a bank, sees a long line, and
leaves to return another time is __________.
Question 9 options:
reneging
balking
blithering
none of the above
cropping
Save
Question 10 (3 points)
In queuing theory, the calling population is another name
for __________.
Question 10 options:
