1. Exercise 3.1 Question 11 (page 102): Alternating disks
2. Exercise 3.2 Question 3 (page 106): Gadget Testing
3. Exercise 3.3 Question 1 (page 112): Closest-pair for points on a line
4. Exercise 3.3 Question 7 (page 113): linear programming problem
5. Exercise 3.4 Question 7 (page 119): clique problem. Describe you algorithm in clear and complete sentences.
6. Exercise 4.1 Question 2 (page 128): Min-max recursion
7. Exercise 4.2 Question 8 (page 135): Partitioning
8. Exercise 4.3 Question 8 (page 139): Binary Search
9. Exercise 4.3 Question 9 (page 139)
10. Exercise 4.6 Question 1 (page 154): Divide and conquer closest pair in 1 dimension. Describe you algorithm in clear and complete sentences.