Site MapHelpFeedbackMultiple Choice Quiz
Multiple Choice Quiz
(See related pages)

1
In the shortest route problem, the objective is to find the shortest route from an origin to a destination through a network.
A)True
B)False
2
Shortest path algorithm given in the text will work even if the costs (distances) of the arcs are negative.
A)True
B)False
3
In the linear programming formulation of the shortest path problem, the constraint corresponding to the origin will have 1 on its RHS.
A)True
B)False
4
Flow conservation is assumed in the spanning tree problem.
A)True
B)False
5
In flows in network, the optimal solution to the maximal flow problem cannot have flows simultaneously in both directions of an arc.
A)True
B)False
6
In the spanning tree algorithm, we try to find the shortest arc from the connected nodes to any nodes of the rest of the graph.
A)True
B)False
7
In the spanning tree problem, one is trying to find the longest tree from the origin to the destination.
A)True
B)False
8
In the shortest route problem, the algorithm will find all shortest paths from any node to any node.
A)True
B)False
9
<a onClick="window.open('/olcweb/cgi/pluginpop.cgi?it=gif::::/sites/dl/free/007299066x/335683/08_9.gif','popWin', 'width=378,height=281,resizable,scrollbars');" href="#"><img valign="absmiddle" height="16" width="16" border="0" src="/olcweb/styles/shared/linkicons/image.gif"> (5.0K)</a>

In Figure 1, using the shortest route algorithm presented in the text, the node that would be labeled with a permanent label next will be
A)1.
B)2.
C)3.
D)5.
10
<a onClick="window.open('/olcweb/cgi/pluginpop.cgi?it=gif::::/sites/dl/free/007299066x/335683/08_10.gif','popWin', 'width=387,height=281,resizable,scrollbars');" href="#"><img valign="absmiddle" height="16" width="16" border="0" src="/olcweb/styles/shared/linkicons/image.gif"> (5.0K)</a>

In Figure 2, using the shortest route algorithm presented in the text book, the label and the node that would get the permanent label will be
A)3 and [5,2].
B)4 and [8,2].
C)5 and [7,1]
D)2 and [3,1]
11
<a onClick="window.open('/olcweb/cgi/pluginpop.cgi?it=gif::::/sites/dl/free/007299066x/335683/08_11.gif','popWin', 'width=381,height=254,resizable,scrollbars');" href="#"><img valign="absmiddle" height="16" width="16" border="0" src="/olcweb/styles/shared/linkicons/image.gif"> (4.0K)</a>

In Figure 3, bold arc and all nodes attached to it is the connected node. Using the algorithm in the text for finding the minimal spanning tree which will be the next node that will be added to the set of connected nodes?
A)3.
B)6.
C)4.
D)5.
12
<a onClick="window.open('/olcweb/cgi/pluginpop.cgi?it=gif::::/sites/dl/free/007299066x/335683/08_12.gif','popWin', 'width=393,height=276,resizable,scrollbars');" href="#"><img valign="absmiddle" height="16" width="16" border="0" src="/olcweb/styles/shared/linkicons/image.gif"> (4.0K)</a>

What is the maximum flow possible from source to sink in the network given in Figure 4?
A)9
B)8
C)7
D)10





To learn more about the book this website supports, please visit its Information Center.
(c)2007 McGraw-Hill Higher Education
Any use is subject to the Terms of Use and Privacy Notice.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.


Intro. Mgmt. Sci. SpreadsheetsOnline Learning Center

Home > Chapter 8 > Multiple Choice Quiz