University of Washington
CSE 326, Data Structures
Homework #5
Due: Wednesday, March 7, 2001, 4:00pm
(NOTE: due at 4:00pm (not the usual 1:30pm))

Winter 2001                                        February 26, 2001
Donald Chinn

Homework is due at the beginning of class on the day specified.
Any homework turned in after the deadline will be considered late.
Late homework policy: You may turn in your homework after the deadline
but before the beginning of the next lecture after it is due, but at
a cost of a 20% penalty.

Please staple all of your pages together (and order them according
to the order of the problems below) and have your name on each page,
just in case the pages get separated.  Write legibly (or type) and
organize your answers in a way that is easy to read.  Neatness counts!
Also, show your work and explain your reasoning.

For each problem, make sure you have acknowledged all persons with
which you worked.  Even though you are encouraged to work together
on problems, the work you turn in is expected to be your own.  When
in doubt, invoke the Gilligan's Island rule (see the course
organization handout). 


* * *
Regular problems (to be turned in) :

1. Weiss, 9.15a.  Indicate the order in which edges are
added to the tree/forest.
2. 7.17a,b,c.
3. 7.38.
* * *

Suggested problems (highly recommended, but not to be turned in) :

1. 9.15b.
2. 9.16
3. 7.12.
4. 7.15.
5. 7.19.
6. 7.23.
7. 7.39, 7.40.
8. 7.41.
9. 7.48.

(As I mentioned in class, although there are no homework
problems -- either regular or suggested -- that come
from the material in Chapter 8 (Union/Find algorithms),
you are still expected to know the algorithms and
running times, as presented in class.)