# Chapter_8 - 1 In the shortest route problem the objective is to find the shortest route from an origin to a destination through a network Student

This preview shows pages 1–6. Sign up to view the full content.

1. In the shortest route problem, the objective is to find the shortest route from an origin to a destination through a network. Student Response Value Correct Answer Feedback A. True 100% B. False 0% Score: 0/0 2. Shortest path algorithm given in the text will work even if the costs (distances) of the arcs are negative. Student Response Value Correct Answer Feedback A. True 0% B. False 100% Score: 0/0 3. In the linear programming formulation of the shortest path problem, the constraint corresponding to the origin will have 1 on its RHS. Student Response Value Correct Answer Feedback A. True 100% B. False 0% Score: 0/0 4.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Flow conservation is assumed in the spanning tree problem. Student Response Value Correct Answer Feedback A. True 0% B. False 100% Score: 0/0 5. In flows in network, the optimal solution to the maximal flow problem cannot have flows simultaneously in both directions of an arc. Student Response Value Correct Answer Feedback A. True 100% B. False 0% Score: 0/0 6. In the spanning tree algorithm, we try to find the shortest arc from the connected nodes to any nodes of the rest of the graph. Student Response Value Correct Answer Feedback A. True 100% B. False 0% Score: 0/0 7.
In the spanning tree problem, one is trying to find the longest tree from the origin to the destination. Student Response Value Correct Answer Feedback A. True 0% B. False 100% Score: 0/0 8. In the shortest route problem, the algorithm will find all shortest paths from any node to any node. Student Response Value Correct Answer Feedback A. True 0% B. False 100% Score: 0/0 9. In Figure 1, using the shortest route algorithm presented in the text, the node that would be labeled with a permanent label next will be Student Response Value Correct Answer Feedback A. 1. 0% B. 2. 100% C. 3. 0% D. 5. 0% Score: 0/0 10.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
In Figure 2, using the shortest route algorithm presented in the text book, the label and the node that would get the permanent label will be Student Response Value Correct Answer Feedback A. 3 and [5,2]. 100% B. 4 and [8,2]. 0% C. 5 and [7,1] 0% D. 2 and [3,1] 0% Score: 0/0 11. In Figure 3, bold arc and all nodes attached to it is the connected node. Using the algorithm in the text for finding the minimal spanning tree which will be the next node that will be added to the set of connected nodes? Student Response Value Correct Answer Feedback A. 3. 100% B. 6. 0% C. 4. 0% D. 5. 0% Score: 0/0 12.
What is the maximum flow possible from source to sink in the network given in Figure 4? Student Response Value Correct Answer Feedback A. 9 0% B. 8 100% C. 7 0% D. 10 0% Score: 0/0 1. In a minimal spanning tree solution, which of the following is not true? Student Response Value A. If you add one more arc to it, it will no longer be a minimal spanning tree 0% B. If you remove an arc, it will no longer be a spanning tree

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/04/2008 for the course ACCT 401 taught by Professor Lewis during the Spring '08 term at West Virginia University at Parkersburg.

### Page1 / 35

Chapter_8 - 1 In the shortest route problem the objective is to find the shortest route from an origin to a destination through a network Student

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online