(a) What are the final values of d(l, l),d(l,2),.

the Floyd-Wa
d(l, 10)? tinue, that is, c
remain - constan
(b) [BB] Find the values of d( l, 5), d(l, 6), d(3, 4), and
d(8, 5) after k = 4. 17. Prove that the
(c) What is II.2
theDiscrete
(d) Mathematics
initial value of d(2, 5)? How does this ically, assume
(c)+ value change Assignment 1 from I to 10?
as k increases VI, V2 . . .,X vn
6. [BB] Suppose
to vconnected
weighted 1 . Prove th
14. The Floyd-Warshall algorithm is applied
1. The Floyd-Warshall algorithm is applied to the graph shown. to the graph is the length
mail carrier's route o
shown.
the 18.
shortest
Show route
that thefr
V2 2 V3
(e) (D) additions
7. Solve the ChineseandP
graph shown.
VI V4 / 19. Discover what
24 a short note ab
V6 V5 46 20. Discover what
2. [BB; K5 ] Solve the Chinese Postman Problem for s5, short note abo
/C6(a) FindlC3,
, and the final values of d(7, 1), d(7, 2),. d(7, 8).

(b) Find
3. [BB] the values
Solve of d(l, 2),Postman
the Chinese d(3, 4), d(2, 5), and d(8, 6) after k = 4.
i.13:d .79!
Problem.
(c) Find the values of d(6, 8) at the start and as k varies from 1 to 8.
2
1X 9M.
1. In the Kiinigsberg Bridge Problem (see Fig 9.1), two8. Solve the
trail. Chinese
Show th
2. A connected graph g has 14 vertices and 88 edges. Show that 5 is Hamiltonian but not
Eulerian. new bridges14are constructed, one joining A to C and graph. It of g1 and g
the other B to D. Use Theorem 10.1.4 to show that the joined by a ne
answer totraveling
3. An encyclopedia salesman, the question
by car, is now toyes.
wishes visit ten towns and return home an Eulerian tra
without passing through the same town twice. He knows that one, but only one, of the towns has
2. toOne 4. True or false?
a direct connection eachof ofthe
the mayoralty
other towns candidates in Kbnigsberg
(that is, connections says that
passing through no other
towns). He also knows he that
canthere
obtain
are a atotal
positive solution
of 39 such to the
direct road bridge prob-
connections between pairs of (a) Every trai
towns. Why is he lem
confident by building
that he will only
be
4. [BB] Solve the Chinese Postman Problem for eachableone
to new
find bridge.
such a Is
route? he telling the (b) Every ope
truth? (c) If there is
graph.
4. Solve the Chinese Postman Problem for each graph.
3. Suppose Q1 and Q2 are graphs with no vertices in com- then there
mon and assume that each graph possesses an Eulerian (d) Every path
5 3>2
I I

I I 2

132 The remaining exerc

in this section for ob
4 6 minimum weight fro
graph g by duplica
 nd the2.map
[BB; K5 ]19.Solve
Applythe Chinese Postman Problem
the Bellman-Ford for s5to
algorithm , the digraphs
/C6 , and lC3, shown, answering by means of a table like Table 11.3.
nd Circuits
4) 3. [BB] Solve the
u5, (a) Chinese
[BB] Postman Problem.
02 l V3

d in one unit time, must precede2

both the laboratory analysis and the
database creation. The library search takes two units8.of Solve the Chinese Postman
time. The laboratory
14 analysis takes two units of time ifgraph.
ch depicts the
it is undertaken after the library search and otherwise
Describe all VI
three units of time. Creation of the database takes one
unit of time if it is delayed until the library search is
tle. The tasks complete and otherwise four units of time.
ired for each5. Apply the(a)
Bellman-Ford
typealgorithm to the digraphs shown,
4. [BB] Solve the What Chinese of scheduling
Postman problem
Problem for iseach
this (I or II)?
graph. (b) Draw the appropriate directed network.
(b) What is the shortest possible time in which this stu-
onths) dent can complete her thesis?
(c) In what order shouldI she5 perform 3>2 her thesis-related

L
I
tion matrix tasks in order to achieve this minimum time?
V3 V4
11. Fred and Wilma Noseworthy I areI planning a dinner party. 2
The things they must do before their guests arrive and
1 1] 132
the time required for each are shown in the following
The remaining exercises conc
in this section for obtaininga
1 0 table. The fish must be caught 4 and
6 the wine purchased minimum weight from a giv
before the table is set. The Noseworthys are not fond
j of raw fish or raw vegetables V5 and do not use wine ingraph g by duplicatingcerta
20. their
[BB]cooking.
Would The it be must be dusted
tablesensible to use before it can be
the Bellman-Ford
lse.
0 Polishing
I] set. Vacuuming isarenever done until party.
the table is set.they
For-must do before their
des 01all but G6. Fred and Wilma
algorithmNoseworthy planning
on undirected a dinner
graphs? The things
Comment.
tunately, Fred and Wilma
for each have the full
in thesupport
followingoftable.
theirThe fish must be
it is removedguests arrive
21.
and the time
(a) [BB]
required
Apply the
are shown
original form of Dijkstra's
0 01 student
caught and the daughterbefore
wine purchased and son, whois set.
the table are The
always are notalgo-
very willing
Noseworthys fond of raw fish
handles go onor raw vegetables and do not use wine in their cooking. The table must be dusted before it can be
rithm.
to help theirDoes
parents it give
with correct
whateverlengths
jobs have of to
shortest
be donepaths?
re0 completed, set. Vacuuming is never done until the table is set. Fortunately, Fred and Wilma have the full
(so up to four jobs can be done simultaneously). The
Explain.
support of their student daughter and son, who are always very willing to help their parents with
0 entire family greetsBellman-Ford
(b)have[BB] their guests together after all tasks
0 j whatever jobs to be Would
done (so up to four jobs can work? Explain.
be done simultaneously). The entire family
his0 (type I orgreets their guests been completed.
have together after all tasks have been completed.
work.I 0
0
0 2
d 0R for Dust house D 3
1 O 0each VI
2
Vacuum house V
V3
Set table T I
each delayed
rcise I are Buy wine W 4
the project be
Catch fish V4 F 6
Pick vegetables P 2
y replacing
he conditions 22. When the Bellman-Ford
Cook food algorithm C 4detects the presence
ces, by one guests
of a negative Greet
weight cycle, canG it be
2 adapted to exhibit
you put an
to complete such a cycle? Explain.
s to complete (a) What
23. (a) [BB] type of scheduling problem
The Bellman-Ford is this
algorithm can (I
be orterminated
II)?
s of Ks. Draw
as soonthe asappropriate directedcolumns
two successive network.are the same; that
Kcan
4 . about this (b) What
is, if is
forthetwoshortest possiblevalues
successive time of
in which
i, the din-
numbers
C2, 3 . ner preparations can be accomplished? Describe the
di(2), ... di(n) are identical. Explain.
critical path and illustrate with a directed network,
geology stu-
 S s * *S S

1. Solve the Chinese Postman Problem for the weighted (a) G-fragments: G,AUG, UCAG
graph given in Exercise 17 of the Chapter 10 Review UC-fragments: G, GGAU, C, C
(a) Problems.
What type of scheduling problem is this (I or II)? Draw the appropriate directed network.
(b) G-fragments: G, G, AUU, UC
2. U,C-fragments: GGGGU, C, U,
(b)Solve
What the Chinese
is the shortestPostman
possible Problem for the
time in which unweighted
dinner preparations can be accomplished?
graph the
Describe critical path and illustrate with a directed network, showing (c)
C3,6. G-fragments:
all labels. UG, CUAAG, A
3. Explain how to solve the Chinese Postman Problem for U.C-fragments: GU, AAG, GAG
(c)aFind the5slack
graph whichin W,
hasC,anand D.
Eulerian trail. 9. Let n > 3 and assume that the comp
vertices labeled IVJI, 11)2, ... , W, and
4.
7. Let g begoing
Before a strongly connected
to school, digraph
John must take awith the property
shower, get dressed, eat breakfast, and finish his
w, to ivj if and only if i < j. Show th
maththatassignment. has indegree
no vertex John will takeequal to its before
his shower outdegree. Prove
getting dressed or eatingon breakfast and is
this digraph he'll
transitive.
getthat at least
dressed beforetwo vertices
finishing his have indegrees
assignment, greater
but there are nothanother restrictions. Taking a shower
their outdegrees.
requires 9 minutes; getting dressed takes 9 minutes if John has first eaten 10. (a) Couldbut
breakfast 5, otherwise
5, 4, 3, 2, 2, 2 be the sc
tournament?
5.12(a)
minutes.
Find Finishing his assignment
two different orientationstakeson12theminutes
edges ifofJohnI(4 has eaten breakfast, but 18 minutes
otherwise.
whichEating
leadbreakfast takes 9 minutes
to nonisomorphic if John has finished his assignment
digraphs. (b) Could 8, minutes
and 18 8, 8, 6, 6, 3, 3, 1,1, I be
otherwise. of a tournament?
(b) Find two different orientations on the edges of IC4
which lead to isomorphic digraphs. 11. Let T be a tournament and let v be an
(a) What type of scheduling problem is this (I or II)? Draw the appropriate directed network.
ing minimum score. Show that the len
6. If A is the adjacency matrix of a digraph and A2 = [bij
(b)find
Find all possible path so from
thatany other vertex to v is I
LbiX
Y andways in which John can carry out his tasks before school
explain. he can
leave in the shortest possible time. 12. In a round-robin tennis tournament, w
7. (a) Show that Dijkstra's algorithm fails and explain is the clear winner, George is the c
8. Showwhy.that Start
Dijkstra's algorithm
at vertex A. fails and explain why. Start at vertex A.other players are tied for second. Sho
of players competing must have been
B 2 C
13. George has to do four things before
exam tomorrow morning: study, sle
D check his e-mail. He intends to sp
A
periods of time studying, three hou
sion. While the sessions could be bac
E one session must occur before he sl
requires one hour, but it also takes an
(b) Apply the Bellman-Ford algorithm to the digraph. to arrive
Apply the Bellman-Ford algorithm to the digraph. Your answer should make clear (and
that yousomething else could b
Your answer should make clear that you understand
understand this algorithm by showing how the labels on vertices change as interval). Eating pizza must precede
the algorithm
proceeds.this algorithm by showing how the labels on vertices at least one of the study sessions. G
change as the algorithm proceeds. hours of sleep if he sleeps after all stu
9. In a round-robin tennis tournament, we
8. Find all RNA chains with the given complete enzymeknow that Alice is the clear winner,
pleted, George is the
but he's clear to settle for fiv
willing
loser, and all other players are tied for second. Show that the number of players
digests. If George competing
checks musthis e-mail between
have been odd.

10. (a) Could 5, 5, 4,3, 2, 2, 2 be the score sequence of a tournament?

(b) Could 8, 8, 8, 6, 6, 3, 3, 1,1, I be the score sequence of a tournament?