The Final will be on Wednesday (12/17) at 1 PM in Wright 5. The Final will be closed-book, but you may have one sheet of paper (8.5"x11", front and back) with notes and the sheet of definitions from section 10.3.
The Final will be comprehensive with an emphasis on chapters 8, 9, 10, and 11.
For each of the problem solving techniques: dynamic programming (ch. 8), and greedy (ch. 9), you should:
For chapter 10, you are responsible for sections 10.1 - 10.3.
For chapter 11, you should have a general understanding of backtracking and branch-and-bound in sections 11.1 and 11.2.
- understand the general concept of the problem-solving technique
- understand the algorithms for each problem-solving techniques discussed in class. Don't try to memorize these algorithms, but have a general idea of how they work so you could give a general English description of how they work.
- be able to apply the problem-solving technique to develop an algorithm to a "new" (i.e., not discussed in class) simple problem