Section 4.1,
problems 29, 31, 33, 43, 45.
Section 4.3,
problems 2, 4, 8, 15, 16, 24.
Section 4.4,
problems 1, 7, 13, 14, 23, 28(a), 29, 36, 38.
Section 5.6,
problems 3, 7, 37(a,b)
Section 5.7,
problems 3, 5, 18, 19, 24, 30.
Section 9.1,
problems 2, 7-13, 21, 23, 26, 28, 31.
Section 9.2,
problems 1, 3, 4, 6, 10, 11, 14, 18, 17(a,b,c),
26-28.
Section 9.3,
problems 1, 5, 6, 11, 13, 33, 35.
Section 9.5,
problems 3, 5-7, 10, 13, 15, 17.
Section 9.6,
problems 1, 3, 8-10, 16.
Section 9.7,
problems 19, 21, 23, 33, 36.
Section
10.1, problems 3, 18, 27, 28, 45, 14 (optional), 47 (optional)
Section
10.2, problems 12, 17, 18.
Section
10.5, problems 3, 8-12, 22, 26.
Section
10.7, problems 7, 8, 11.
problem
on graph coloring solution
problem
on applications of graph coloring solution
problem
on comparing algorithm orders
Section
11.4, problems 13, 18, 19, 20
Section
11.5, problems 5, 6 and the following problem:
Apply the insertion sort
algorithm to the following arrays:
a)
12 34 5
9 20 11
b)
Mark Rebecca Nick Megan Jennifer David Mike
HW on maximum
flow problem Solution
HW problem
on baseball elimination
Solutions to
selected problems from the textbook