## MM305-Find the shortest route from Node 1 to Node 5.

Question

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 2. 2.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 3. 3.Find the least amount of cable that will allow Jack’s Cable Company to connect the following nodes (houses).

From

Node

To

Node

Distance

1

2

250

1

3

150

1

4

400

2

3

50

2

4

100

3

4

200

(Points : 1)

250

400

350

300

Question 4. 4.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 5. 5.Find the shortest route from Node 1 to Node 6.

From

Node

To

Node

Distance

1

1

2

100

2

1

4

215

3

2

3

70

4

2

4

200

5

2

5

110

6

3

4

320

7

4

5

200

8

4

6

200

9

5

6

200

(Points : 1)

total distance = 350

total distance = 410

total distance = 270

total distance = 520

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

From

To

Distance

1 2 300

2 3 150

1 3 200

(Points : 1)

450

150

350

650

Question 8. 8.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 9. 9.Which of the following techniques is not discussed in Chapter 7?(Points : 1)

shortest-route

maximal-flow

minimal-flow

minimal-spanning tree

Question 10. 10.A point in the network, that is at the beginning or end of an arc is called a(n) ________.(Points : 1)

arc

branch

line

node

Question 11. 11.A technique that allows a manager to determine the greatest amount of material that can move through a network is called(Points : 1)

maximal-flow.

maximal-spanning.

shortest-route.

maximal-tree.

Question 12. 12.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 13. 13.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 325

1 4 50

3 4 350

3 5 400

4 5 450

(Points : 1)

300

525

675

1925

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

From Node

To Node

Fluid Flow

1 3 400

3 1 100

1 2 300

2 1 0

2 3 100

3 2 100

(Points : 1)

100

400

500

700

Question 15. 15.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 16. 16.A line in a network that may represent a path or a route is called a(n) ________.(Points : 1)

arc

path

line

sink

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 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 18. 18.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 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.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

## Recent Comments