# Homework Assignments

Homework is due the Wednesday after the work is assigned. Remember that you are allowed to turn in up to 3 homework assignments late, but they should not be more than 1 week late in any case.

## The assignments

• Homework 1, due 9/10/97
• Homework 2, due 9/17/97
• Exercise 18.4-3, page 375
• Exercise 18.4-4, page 375
• Problem 18-3, page 376. Note that alpha is strictly greater than 1/2 for parts c-e.
• Homework 3, due 9/24/97
• Problem 18-2, page 376
• Exercise 20.1-3, page 405
• Exercise 20.2-10, page 417
• Homework 4, due 10/1/97
• Problem 21-2, page 439
• Exercise 22.3-4, page 450. Correction: in this exercise, where the question says "UNION" replace the word with "LINK".
• Problem 22-1, page 458
• Homework 5, due 10/15/97
• Exercise 4.4-2, page 72.
• Problem 4-4, page 73.
• Exercise 27.2-8, page 600.
• Homework 6, due 10/22/97
• Exercise 27.2-9, page 600.
• Problem 27-1, page 625.
• Problem 27-4, page 627.
• Homework 7, due 10/29/97
Do the dynamic programming question on the June 1997 comprehensive exam. A PostScript version is available on-line.
• Homework 8, due 11/05/97
• Exercise 28.1-3, page 638.
• Exercise 28.4-1, page 648.
• Exercise 28.4-3, page 648.
• Homework 9, due 11/19/97
• Exercise 35.1-3, page 891.
• Exercise 35.1-5, page 891.
• Exercise 35.2-6, page 898.
• Homework 10, due 12/3/97
• Exercise 36.5-2
• Exercise 36.5-5
• Prove that 3-colorability for planar graphs is NP-complete. (You may assume that 3-colorability for general graphs is NP-complete.)
• Homework 11, due 12/10/97
• Exercise 36.2-3
• Exercise 36.5-4
• Problem 37-2