MGT2251_Quiz10_102711 (2)

MGT2251_Quiz10_10271 - B pick any path with some flow C eliminate any node that has a zero flow D add a dummy flow from the start to the finish E

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Last Name, First Name: T-Square ID QUIZ # 10 FORM: A DATE: 10/27/2011 TODAY's QUESTIONs and Your Answers: 1 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 2 Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 3. From To Fluid Node Node Flow 1 3 400 3 1 100 1 2 300 2 1 0 2 3 100 3 2 100 3 Find the shortest route from Node 1 to Node 6. From To Node Node Distance 1 2 150 1 3 200 2 4 200 2 3 50 4 6 100 3 4 300 3 5 350 5 6 100 4 The first step in the maximal-flow technique is to A pick the node with the maximum flow.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: B pick any path with some flow. C eliminate any node that has a zero flow. D add a dummy flow from the start to the finish. E None of the above 5 The minimal-spanning tree technique finds the shortest route to a series of destinations. TRUE FALSE 6 In the minimal-spanning tree technique, it is necessary to start at the last node in the network. TRUE FALSE 7 Cable television companies would employ the shortest-route technique TRUE FALSE to lay out the cables connecting individual houses....
View Full Document

This note was uploaded on 01/30/2012 for the course MGT 2251 taught by Professor Chang during the Fall '08 term at Georgia Institute of Technology.

Ask a homework question - tutors are online