There are seven questions for 110 total points. (Grading will be out of 100, so you have a chance to earn extra credit.) 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.
Sixty points worth of the questions are individual, meaning that each student is to submit a separate independent writeup. The other fifty points worth 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.
Page 528: Problems 8.41 (I,20).
Pages 550: Problem 9.1 (G,15). Hint: The answer is (b), your job is to justify it. I know most of you weren't at the lecture on Chapter 9 but this problem only requires understanding the definition of Quantified 3-SAT or Competitive 3-SAT from that chapter.
Pages 594-598: Problems 10.5(a) (I,10) and 10.8 (G,15).
Pages 651-659: Problems 11.3 (G,20) and 11.4 (I,15).
Page 703: Problem 12.2 (I,15).
Last modified 29 November 2006