CSCI 1323 (Discrete Structures), Spring 2005:
Homework 8

Assigned:

April 25, 2005.

Due:

April 29, 2005, at 5pm. Not accepted past May 2 at noon.

Credit:

20 points.

Problems

Do the following problems. You do not need to turn in answers for the ones marked ``Not to turn in''. Most such problems will be those for which the textbook provides an answer in the back of the book, so you can check your work.

If you are covered by the Academic Honor Code, treat this assignment as pledged work (writing ``pledged'' and your name on what you turn in).

1. (4 points) Do problem 2 on p. 362 of the textbook.

2. (Not to turn in.) Do problem 7 on p. 362 of the textbook.

3. (3 points) Do problem 8 on p. 362 of the textbook.

4. (3 points) Do problem 32 on p. 365 of the textbook.

5. (3 points) Do problem 47 on p. 367 of the textbook.

6. (Not to turn in.) Do problem 66 on p. 368 of the textbook.

7. (3 points) Do problem 17 on p. 384 of the textbook.

8. (4 points) Do problem 32 on p. 384 of the textbook. (Use the textbook's definition of height -- maximum number of ``hops'' from root to leaf, which would mean that a tree with only a root node would have height 0.)

9. (Not to turn in.) Do problem 38 on p. 385 of the textbook.

10. (Not to turn in.) Do problem 39 on p. 385 of the textbook. (Use the textbook's definition of height -- maximum number of ``hops'' from root to leaf, which would mean that a tree with only a root node would have height 0.)