From

Node

To

Node

(Points : 1)

300

450

550

650

Question 2.2. 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 3.3. 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 4.4. The minimal-spanning technique would best be used (Points : 1)

to assign workers to jobs in the cheapest manner.

to determine LAN network wiring within a building.

to minimize traffic flow on a busy highway.

by a trucking company making frequent but repeatable drops.

Question 5.5. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

525

300

400

600

500

Question 7.7. Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from City 1 to City 7?

From City

(Points : 1)

1200

1400

900

800

Question 8.8. Find the least amount of cable that will allow Jack’s Cable Company to connect the following nodes (houses).

From

Node

To

(Points : 1)

250

400

350

300

Question 9.9. Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4.

From

Node

To

Node

(Points : 1)

100

150

200

50

Question 10.10. Solve the minimal-spanning tree problem defined below:

Branch Start Node

End Node

Cost

1 1 3 5

2 1 2 1

3 2 4 3

4 2 5 4

5 3 4 6

6 4 6 2 (Points : 1)

total cost = 13

total cost = 15

total cost = 17

total cost = 11

Question 11.11. In network models, the lines connecting the nodes are called ________. (Points : 1)

bridges

arrows

spans

arcs

Question 12.12. Given the following nodes and distances, determine the minimum length of cable necessary to connect all six nodes.

(Points : 1)

200

300

400

500

Question 13.13. 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 (Points : 1)

shortest-route.

maximal-flow.

minimal-flow.

minimal-spanning tree.

Question 14.14. 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 15.15. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

From

Question 16.16. The shortest-route technique might be logically used for (Points : 1)

finding the longest time to travel between two points.

finding the shortest travel distance between two points.

finding the most scenic route to allow travel to several places during a trip on spring break.

connecting all the points of a network together while minimizing the distance between them.

Question 17.17. Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

(Points : 1)

900

650

400

1200

Question 18.18. Find the shortest route from Node 1 to Node 6.

From

(Points : 1)

300

450

550

650

Question 19.19. All the nodes must be connected in which of the following techniques? maximal-spanning tree

shortest-route

maximal-flow

minimal-spanning tree

Question 20.20. The origin or beginning node in a network is called ________.

home

source