Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 100 1 3 50 2 3 200 2 5 300 1 4 50 3 4 350 3 5 400 3 6 400 4 5 450 4 6 350 5 6 200 (Points : 1) 900 1200 1100 700 Question 2.2. Find the shortest route from Node 1 to Node 5. From Node To Node Distance 1 2 200 1 3 150 2 3 50 2 4 300 3 4 250 3 5 200 4 5 150 (Points : 1) 350 400 450 600 Question 3.3. The final node or destination in a network is called a(n) ________. (Points : 1) arc branch source sink Question 4.4. Given the following nodes and distances, determine the minimum length of cable necessary to connect all six nodes. From Node To Node Distance 1 1 2 150 2 1 3 200 3 2 3 100 4 2 4 200 5 2 5 50 6 3 4 350 7 3 5 300 8 4 6 100 9 5 6 100 (Points : 1) 200 300 400 500 Question 5.5. The minimal-spanning tree technique would best be used (Points : 1) by a forest ranger seeking to minimize the risk of forest fires. by a telephone company attempting to lay out wires in a new housing development. by an airline laying out flight routes. None of the above Question 6.6. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 200 1 3 300 1 5 400 2 3 300 2 4 400 3 4 200 3 5 200 4 5 100 4 6 300 5 6 400 (Points : 1) 1000 800 700 1100 Question 7.7. Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4. From Node To Node Fluid Flow 1 2 400 2 1 0 1 4 200 4 1 200 1 3 200 3 1 0 2 4 200 4 2 200 3 4 300 4 3 300 (Points : 1) 200 300 600 700 Question 8.8. All the nodes must be connected in which of the following techniques? (Points : 1) maximal-spanning tree shortest-route maximal-flow minimal-spanning tree Question 9.9. The first step in the maximal-flow technique is to (Points : 1) pick the node with the maximum flow. pick any path with some flow. eliminate any node that has a zero flow. add a dummy flow from the start to the finish. Question 10.10. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 100 2 4 150 1 3 200 2 3 50 3 4 175 4 5 250 3 5 300 (Points : 1) 100 150 550 1225 Question 11.11. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 200 1 3 300 2 3 350 2 4 350 3 4 250 (Points : 1) 100 750 850 900 Question 12.12. The shortest-route technique would best be used to (Points : 1) plan the routes for a vacation driving tour. plan the route for a school bus. determine the path for a truck making frequent runs from a factory to a warehouse. All of the above Question 13.13. Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4. From Node To Node Fluid Flow 1 3 200 3 1 0 1 2 150 2 1 50 2 3 100 3 2 100 3 4 150 4 3 50 (Points : 1) 100 150 200 50 Question 14.14. The maximal-flow technique would best be used (Points : 1) to assign workers to jobs in the cheapest manner. to determine the number of units to ship from each source to each destination. to determine LAN network wiring within a building. to maximize traffic flow on a busy highway. Question 15.15. Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 5. From Node To Node Fluid Flow 1 2 300 2 1 0 1 3 0 3 1 150 1 4 200 4 1 200 1 5 100 5 1 100 2 4 200 4 2 200 3 4 250 4 3 300 3 5 300 5 3 250 4 5 100 5 4 0 (Points : 1) 300 400 600 500 Question 16.16. When using the shortest-route technique, the first step is to (Points : 1) connect the nearest node that minimizes the total distance to the origin. trace the path from the warehouse to the plant. determine the average distance traveled from source to end. find the nearest node to the origin and put a distance box by the node. Question 17.17. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 120 2 3 100 1 3 200 2 4 150 3 5 90 4 5 170 (Points : 1) 290 310 620 460 Question 18.18. The shortest-route technique would best be used to ________ (Points : 1) determine the number of units to ship from each source to each destination. determine the amount of LAN network wiring within a building. minimize the amount of traffic flow on a busy highway. determine the path for a truck making frequent but repeatable drops. Question 19.19. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 100 1 3 200 2 3 100 2 4 150 2 5 200 3 4 150 3 5 300 4 5 250 4 6 200 5 6 100 (Points : 1) 900 650 400 1200 Question 20.20. Find the shortest route from Node 1 to Node 6. From Node To Node Distance 1 2 150 1 3 200 2 3 100 2 4 200 2 5 50 3 4 350 3 5 300 4 6 100 5 6 100 (Points : 1) 300 450 550 650