# CMPSCI 250: Introduction to Computation

### David Mix Barrington

### Spring, 2012

# Homework Assignment #6

#### Posted Saturday 17 March 2012

#### Due on paper in lecture, Friday 30 March 2012.

There are seven questions for 60 total points plus 10 extra credit.
All are from
the textbook, *
Mathematical Foundation for Computer Science*. Note that the book has
both Exercises and Problems -- make sure you are doing a Problem and not the
Exercise with the same number. The number in parentheses following each problem
is its individual point value.

Students are responsible for understanding and following
the academic honesty
policies indicated on this page.

Correction in purple added 25 March.

Correction in orange added 27 March.

- Problem 9.1.3 (10XC)
- Problem 9.1.5 (10) Please consider trees with depth
*exactly* d and degree *at most* k (that is, no node has
more than k children)
- Problem 9.3.1 (10)
- Problem 9.3.5 (10) There is a typo in the problem statement --
"2n/3" should read "2m/3". Also, you should assume
that m > 1.
- Problem 9.4.2 (10)
- Problem 9.5.2 (10) By "no node has more than b neighbors" we
mean "no node has more than b edges
*to* other nodes".
- Problem 9.6.2 (10)

Last modified 27 March 2012