There are eight questions for 100 total points. All are from the textbook, Algorithm Design by Kleinberg and Tardos. "Exercise 1.1.", for example, means the exercise numbered "1" at the end of Chapter 1.
The number after each problem is its individual point value.
Students are responsible for understanding and following the academic honesty policies indicated on this page.
Half the questions are individual, meaning that each student is to submit a separate independent writeup. The other half are group questions. Groups are designated on the course main page. Each group should submit only one writeup of the group problems.
Note that when you are asked to provide an algorithm to solve a problem, you are responsible for arguing (proving if necessary) that the algorithm is correct and operates within any time bound that you are claiming for it.
Pages 415-448: Problems 7.24 (I,10), 7.27 (I,10), and 7.33 (G,10).
Pages 505-529: Problems 8.1 (I,10), 8.7 (I,10), 8.16 (G,15), 8.19 (G,25), and 8.26 (I,10).
Last modified 13 November 2006