The final exam is cumulative but more weight (probably roughly two thirds) will be given to topics covered since the midterm. So, review all topics covered in lecture or homework assignments except a few topics clearly marked as optional (notably AVL deletion and the details of the proof for the lower bound for comparison sorting).
Also not included is the lecture on Programming Languages. For advanced topics like dynamic programming, backtracking, p vs. np, np-completeness, you DO need to know the BASIC ideas about how they work. I will not ask you to write any code or do any proofs on these topics, but you SHOULD understand the main idea behind how they work.
Our exam will consist of various types of short-answer questions. You may be asked to write or read Java code or pseudocode. It will be similar in style to the midterm.
Below we have repeated the sample midterms from the study guide for the midterm. Because our final exam is cumulative, it makes sense to provide questions from old midterm exams. In addition, we have provided a few additional sample questions, but we do not have as many available.
Please understand these caveats:
Sample exams:
Midterm 1:
Midterm 2:
Final exam:
Some additional questions
unsolved
solved
Note: