10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Written Work 9 | Network Models

Due
May 10 at 11:59pm
Points
30
Questions
14
Available
May 5 at 5pm - May 10 at 11:59pm
Time Limit
120 Minutes

This quiz was locked May 10 at 11:59pm.

Attempt History
Attempt Time Score
LATEST Attempt 1
120 minutes 30 out of 30

Score for this quiz:

30 out of 30
Submitted May 6 at 11:38am
This attempt took 120 minutes.

Question 1 1
/ 1 pts

The shortest-route problem finds the shortest-route

 
from the source to the sink

Correct!  
from the source to any other node.

 
from any node to any other node.

 
from any node to the sink.

Question 2 1
/ 1 pts

We assume in the maximal flow problem that

https://canvas.instructure.com/courses/4087476/quizzes/10988833 1/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Correct!  
the flow out of a node is equal to the flow into the node.

 
the source and sink nodes are at opposite ends of the network.

 
the number of arcs entering a node is equal to the number of arcs exiting
the node.

 
None of the alternatives is correct.

Question 3 1
/ 1 pts

Statement I: The direction of flow in the shortest-route problem is always

out of the origin node and into the destination node.

Statement II: The maximal flow problem can be formulated as a

capacitated transshipment problem.

Correct!  
True, True

 
True, False

 
False, True

 
False, False

Question 4 1
/ 1 pts

Consider a maximal flow problem in which vehicle traffic entering a city is

routed among several routes before eventually leaving the city. When
represented with a network,

https://canvas.instructure.com/courses/4087476/quizzes/10988833 2/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

 
the nodes represent stoplights.

Correct!  
the arcs represent one way streets.

 
the nodes represent locations where speed limits change.

 
None of the alternatives is correct.

Question 5 1
/ 1 pts

Consider a shortest route problem in which a bank courier must travel

between branches and the main operations center. When represented
with a network,

 
the branches are the arcs and the operations center is the node.

 
the branches are the nodes and the operations center is the source.

Correct!  
the branches and the operations center are all nodes and the streets are
the arcs.

 
the branches are the network and the operations center is the node.

Question 6 2
/ 2 pts

Consider the network below. Find the shortest-route path from 1-7.

https://canvas.instructure.com/courses/4087476/quizzes/10988833 3/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

  

From 1
to 2

From 2
to 4

From 4
to 7

From 0
to 0

Answer 1:

Correct! 1

Answer 2:

Correct! 2

Answer 3:

Correct! 2

Answer 4:

Correct! 4

Answer 5:

Correct! 4

Answer 6:

Correct! 7

Answer 7:

Correct! 0

https://canvas.instructure.com/courses/4087476/quizzes/10988833 4/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Answer 8:

Correct! 0

Question 7 2
/ 2 pts

Consider the network below. What will be the shortest distance from the
path you have chosen?

  

Correct!
20

orrect Answers 20 (with margin: 0)

Question 8 2
/ 2 pts

Consider the following shortest-route problem involving six cities with the
distances given. Find the shortest path from City 1 to City 6.

https://canvas.instructure.com/courses/4087476/quizzes/10988833 5/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

*Note always choose the shortest route (path) from each node.  

From 1
to 2

From 2
to 5

From 5
to 6

Answer 1:

Correct! 1

Answer 2:

ou Answered 2

orrect Answer 3

Answer 3:

ou Answered 2

orrect Answer 3

Answer 4:

orrect Answer 4

ou Answered 5

Answer 5:

orrect Answer 4

ou Answered 5

https://canvas.instructure.com/courses/4087476/quizzes/10988833 6/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Answer 6:

Correct! 6

Question 9 2
/ 2 pts

Consider the following shortest-route problem involving six cities with the
distances given. What is the shortest distance from City 1 to City 6.

Correct!
10

orrect Answers 10 (with margin: 0)

Question 10 4
/ 4 pts

Find the network (connection) of the diagram below using minimal

spanning tree.

https://canvas.instructure.com/courses/4087476/quizzes/10988833 7/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

From 1 to 2

From 2
to 4

From 4
to 5

From 4
to 3

From 4
to 6

From 6
to 7

Answer 1:

Correct! 2

Answer 2:

Correct! 2

Answer 3:

Correct! 4

Answer 4:

Correct! 4

Answer 5:

Correct! 5

Answer 6:

Correct! 4

https://canvas.instructure.com/courses/4087476/quizzes/10988833 8/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Answer 7:

Correct! 3

Answer 8:

Correct! 4

Answer 9:

Correct! 6

Answer 10:

Correct! 6

Answer 11:

Correct! 7

Question 11 2
/ 2 pts

What is the total distance of the network you have made (using Minimal
Spanning Tree)  from the diagram below.

  

Correct!
35

https://canvas.instructure.com/courses/4087476/quizzes/10988833 9/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

orrect Answers 35 (with margin: 0)

Question 12 4
/ 4 pts

The numbers on this network represent times to distribute a message.

Use the minimal spanning tree algorithm to determine how messages
should be passed in order to minimize total time.

  

From 1 to 7

From 1
to 2

From 2
to 3

From 1
to 8

From 4
to 7

From 4
to 5

From 5
to 6

Answer 1:

Correct! 7

Answer 2:

Correct! 1

https://canvas.instructure.com/courses/4087476/quizzes/10988833 10/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Answer 3:

Correct! 2

Answer 4:

Correct! 2

Answer 5:

Correct! 3

Answer 6:

Correct! 1

Answer 7:

Correct! 8

Answer 8:

ou Answered 4

orrect Answer 7

Answer 9:

orrect Answer 4

ou Answered 7

Answer 10:

Correct! 4

Answer 11:

Correct! 5

Answer 12:

Correct! 5

https://canvas.instructure.com/courses/4087476/quizzes/10988833 11/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

Answer 13:

Correct! 6

Question 13 2
/ 2 pts

The numbers on this network represent times to distribute a message.

What is the minimum time for this network model using Minimal Spanning
Tree Technique.

  

Correct!
150

orrect Answers 150 (with margin: 0)

Question 14 5
/ 5 pts

The network below shows the flows possible between pairs of six
locations. Find the maximal flow possible from Node 1 to Node 6.

https://canvas.instructure.com/courses/4087476/quizzes/10988833 12/13
10/17/22, 7:48 PM Written Work 9 | Network Models: 2nd 21-22 Bus Math 42 Management Science I

  

Correct!
48

orrect Answers 48 (with margin: 0)

Quiz Score:
30 out of 30

https://canvas.instructure.com/courses/4087476/quizzes/10988833 13/13