This exam will focus mainly on the second half of class. You will still be responsible for topics learned in the first half of class, especially those that we have built on (recursion, runtime analysis, node/pointer data structures). However, it is unlikely, for instance, that I will ask you to implement a stack. We have the class period scheduled for the exam, but I will not rip it out of your hands until about 12:30. You will be allowed no calculator or book, but can bring a single 3" x 5" index card, upon which you may write anything that you so desire. This card should have your name on it, and will be turned in with your exam.
The exam will focus primarily upon the material covered in class. Not everything we've done in class has been in the online notes , so if you missed any days, be sure to get the notes from someone. To study, you may find it helpful to skim over your notes and the online notes. What will be even more useful is to do problems. I've typed up some practice problems here:
Exam 2 Practice ProblemsThere is an additional slew of practice problems in the online notes, along with corresponding answers. (These are listed in the "Test Yourself" sections.) I encourage you to do those. You can also create problems for yourself. You should understand the implementations of each of the data structures/algorithms we've done in class, as well as their runtimes. You are also responsible for the material covered in the assignments. As always, feel free to come in and ask me whatever questions you might have.