UMBC CMSC441, Design & Analysis of Algorithms, Spring 2002, Section 0101
Homework Assignments
Homework questions not from the textbook are available in Adobe Acrobat
(PDF) format.
Download the free Acrobat Reader
here if you don't already have it.
Available in PDF.
- Exercise 4.1-5, page 67.
- Exercise 4.2-3, page 72.
- Exercise 4.3-1, parts a, b and c, page 75.
- Problem 4-4, parts c, d, e and g, page 86.
- Exercise 6.3-3, page 135.
- Exercise 6.4-3 or 6.4-4, page 136.
- Exercise 6.5-7, page 142.
- Problem 7-3, page 161.
- Problem 8-3, page 179.
- Problem 8-4, page 179.
- Exercise 9.3-7, page 193.
- Exercise 9.3-9, page 193.
- Exercise 15.4-5, page 356.
- Problem 15-7, page 369.
- Problem 15-4, page 367.
- Exercise 16.2-4, page 384.
- Exercise 16.2-5, page 384.
- Exercise 22.1-5, page 530.
- Exercise 22.2-4, page 539.
- Exercise 22.2-6, page 539.
For this question, you must also prove that your
algorithm is correct --- i.e., argue that if
a designation exists, then your algorithm will output one
AND if no such designation exists, your algorithm
will also say so.
- Exercise 22.4-2, page 552.
- Exercise 22.5-3, page 557.
- Exercise 22.5-4, page 557.
- Exercise 22.5-7, page 557.
Hint: First prove that a directed graph is semi-connected
if and only if its component graph is semi-connected. Then,
prove that a directed acyclic graph is semi-connected if and only
if in any topological ordering of the graph there is always
an edge between two consecutive vertices in the topologial ordering.
(The last condition implies that the edges of the graph form
a total order and that the topological odering is unique.)
- Exercise 23.1-2, page 566.
- Exercise 23.2-5, page 574.
- Exercise 24.1-4, page 591.
- Exercise 24.3-4, page 600.
- Exercise 24.3-6, page 600.
- Exercise 25.2-7, page 635.
- Exercise 25.2-8, page 635.
Last Modified:
6 May 2002 11:54:56 EDT
by
Richard Chang
to Spring 2002 CMSC 441 Section Homepage