From the de Berg et al. Computational Geometry textbook:

1. 10 points. Problem 5.1, but don't use the master theorem. Instead, prove by induction that Q(n) is at most cn ^1/2 - 2, for some constant c. Also, you don't need to prove the lower bound.
2. 10 points. Problem 5.3 (just parts a and b)
3. 10 points. Problem 5.5 (just parts a and b)
4. 10 points. Problem 5.9
5. 10 points. Problem 5.10 (just parts a and b)