GROUP 4- NETWORK MODEL AND
INVENTORY MODEL QUIZ vertex
PART I: MULTIPLE CHOICE
1.Which of the following best describes
Dijkstra's algorithm?
A) Consider edges in increasing order of
their weights
Add edge to tree and relax all edges that are
part of the tree
B) Consider edges in increasing order of
their weights
Add edge to tree and relax all edges pointing
from that vertex
C) Consider vertices in increasing order of
distance from s
Add vertex to tree and relax all edges that
are part of the tree
D) Consider vertices in increasing order of
distance from s
Add vertex to tree and relax all edges
pointing from that vertex
Answer: D
2.One of the statements describing Dijkstra's
algorithm is wrong.
Find the incorrect statement.
A) Dijkstra's algorithm computes a spanning
tree
B) In Dijkstra's algorithms each edge e = v -
> w is relaxed exactly once (when v is
relaxed)
C) Dijkstra's algorithm computes a shortest
path from all vertices to a given destination
D) Dijkstra's algorithm computes a shortest
paths tree in any edge-weighted digraph
with non-negative weights
Answer: C
3.What is Economic Production Quantity
(EPQ)?
A. The maximum production quantity a
company can achieve in a given time period.
B. The optimal production lot size to
minimize total annual production setup and
inventory holding costs.
C. The minimum production quantity
required to meet customer demand.
D. The average production quantity over a
year.
Answer: B.
4.What are the assumptions of EPQ?
A. Orders are received incrementally during
production.
B. Demand is constant and known.
C. Holding costs are proportional to the
inventory level.
D. All of the above.
Answer: D
PERT and CPM
a. are most valuable when a small number of
activities must be scheduled.
b. have different features and are not applied
to the same situation.
c. do not require a chronological relationship
among activities.
d. have been combined to develop a
procedure that uses the best of each.
ANS: D
5.A technique that allows a researcher to
determine the greatest amount of material
that can move through a network is called
A) maximal-flow.
B) maximal-spanning.
C) shortest-route.
D) maximal-tree.
D) latest time that an activity can be finished
without delaying the entire project.
Answer: C
9. Given an activity's optimistic, most likely,
and pessimistic time estimates of 2, 5, and
14 days respectively, compute the PERT
expected activity time for this activity.
A) 6
B) 7
C) 9
D) 5

Answer: A Answer: A

6.The two most common objectives for the 10. PERT stands for
assignment problem are the minimization of A) probabilistic evaluation and review
A) uncertainty or inexperience. technique.
B) total costs or inexperience. B) program evaluation and review
C) total costs or total time. technique.
D) total time or inexperience. C) probability of expected run times.
D) program of expected run times.
Answer: C
Answer: B
7.A certain type of computer costs $1,000,
and the annual holding cost is 25%. Annual
demand is 10,000 units, and the order cost is
$150 per order. What is the approximate PART II: TRUE/ FALSE:
economic order quantity?
a. 16 11.ABC usually results in less appropriate
b. 70 management decisions.
c. 110
d. 183 TRUE

Answer: C FALSE

8.In a PERT network, the earliest (activity) Answer: False

start time is the
A) earliest time that an activity can be 12.In a network flow problem, the maximal
finished without delaying the entire project. flow is always equal to the capacity of the
B) latest time that an activity can be started minimum cut in the network. True or False
without delaying the entire project.
C) earliest time that an activity can start Answer: False
without violation of precedence
requirements.
13.Economic order quantity is the ideal Answer: True
quantity of units a company should purchase
to meet demand while minimizing inventory 17.In the simple EOQ model, if annual
costs such as holding costs, shortage costs, demand were to double, the EOQ would also
and order costs. double
Answer: False
Answer: False
18.The reorder point is the inventory level at
14.Prim's algorithm is a greedy algorithm which action is taken to replenish the
that finds the minimum spanning tree for a stocked item.
weighted undirected graph.
Answer: true
Answer: True
19. Units of safety stock are additions to the
One might use the minimal-spanning model reorder point that allow for variability in the
to minimize the time spent to complete a set rate of demand, the length of lead time, or
of tasks both.
when the time to perform a task is dependent
on the previous task accomplished. Answer: True
ANSWER: FALSE
One might use the minimal-spanning model
to minimize the time spent to complete a set
of tasks
when the time to perform a task is dependent
on the previous task accomplished.
ANSWER: FALSE
One might use the minimal-spanning model
to minimize the time spent to complete a set
of tasks
when the time to perform a task is dependent
on the previous task accomplished.
ANSWER: FALSE
One might use the minimal-spanning model
to minimize the time spent to complete a set
of tasks
20.In the quantity discount model, the cost
when the time to perform a task is dependent
of acquiring goods (product cost) is not a
on the previous task accomplished.
factor in determining lot size.
ANSWER: FALSE
15.We may begin the maximal-flow
Answer: False
technique by picking an arbitrary path
through the network.
Answer: True
16.The maximal-flow model assumes that
there is a net flow from "source" to "sink".
*Prepared By:Goup 4- Rosalie Bonghanoy