- Homework 1. Due Thursday, January 15
- Problems 1.2.2, 1.3.1, 1.3.2, 1.8.9, and 2.2.3.
For problem 1.8.9:, let the height and size of an empty tree, nil, be 0 and the height and size of a leaf be 1. Problem 2.2.3 may be harder than the others.
- Homework 2. Due Thursday, January 22
- Problems 2.2.7 (b only), 2.2.8, 2.2.12 (a only), 2.2.14, 2.3.2, and 2.4.9.
- Homework 3. Due Thursday, January 29
- Problems 2.4.18, 2.5.6, 2.5.7 (a only), 2.5.18, 2.5.27, and 2.5.29 (parts a and c only).
- Homework 4. Due Thursday, February 5
- Problems 3.3.4, 3.3.9, 3.3.10 (b only), 3.3.12.
- Homework 5. Due Thursday, February 12
- Problems 3.4.2 (easy warm-up), 3.4.4 (could be tricky but fun), 3.4.8, and 3.4.21. The last problem is longer and important because it is a summary of what we've covered in this chapter to this point.
- Homework 6. Due Thursday, February 19
- Problems
3.5.5,
3.5.15 (see note),
3.5.16 (a-c only),
3.6.2,
3.6.3.
Note: In problem 3.5.15, only show that there is no homomorphism A3->A1 and ignore the part asking you to show that there is more than one homomorphism A2->A1.
- Homework 7. Due Thursday, February 26
- Problems
3.6.7, 5.2.4, and 5.2.5.
- Homework 8. Due Thursday, March 5
- Problems
5.2.14, 5.2.19, 5.2.30 (parts a,b,c only), 5.2.39, and 5.2.41 .
- Homework 9. Due Thursday, March 12
- Problems
6.2.1, 6.3.3, and 6.3.4.
- Homework 10. Due Thursday, March 19, by 10AM
- Problems
6.5.1 (parts a and c only), 6.5.4 (parts a and b only), 6.5.6, 6.5.7 (parts a and c only).
Please submit homework to the drop-off box or by email. Homework submitted by email should be a single pdf-file.
If you submit by email, you will get email confirmation from Stephan within one hour that your homework arrived.