The final exam will be comprehensive, and will cover all of the material from the first two midterm exams along with chapters 16, 18, and 34.
The exam will be a written, in-class exam. The exam is a closed book exam, but I will allow you to bring two pages of notes with you to the exam.
You should look over the review problems for exams one and two first. In your review you should make sure that you review dynamic programming problems in particular - I guarantee that there will be a problem on the final that involves constructing a recursive solution to a problem and then converting that to a dynamic programming solution.
Additionally, you should be prepared to answer a question involving using a polynomial time reduction to prove that a problem is NP-Complete. Some examples of sample problems to look at for this problem are problems
34.5-1, 34.5-5, 34.5-7, 34.5-8
None of these problems tell you which known NP-Complete problem to do the reduction from. this set of notes online gives some suggestions on what to do for each of these problems.
Here also are some review questions from chapters 16 and 18:
16-2, 16-3, 18.2-1, 18.3-1