The test will be closed-book, but you may have one sheet of paper (8.5"x11", front and back) with notes.
For the test, you should:
0) understand the concept of big-oh, theta, and omega notation. I will not ask you to find the constants c and N to prove a function satisfies one of the definitions, but you should have a good feel for the usage and meaning of these notations.
1) understand the general concept of the divide-and-conquer problem-solving technique
2) understand the divide-and-conquer algorithms for problems discussed in class
3) be able to apply divide-and-conquer technique to "new" (i.e., not discussed or not in the text) simple problems
4) be able to write recurrence relations for divide-and-conquer algorithms
5) be able to solve recurrence relations using the techniques of Appendix B (especially the technique of using the characteristic equation)
6) be able to analyze an algorithm containing nested loops to determine its theta notation