The final exam is comprehensive. It will cover material from both textbooks; however, most questions will test material covered in the second part of the course, from the Kruse and Ryba textbook.
The exam will be closed book but you are allowed to bring
a crib sheet (a normal-sized 8.5x11 in paper). Preparing
a crib sheet is a useful study tool; it helps you to review and organize
the material before the test. Your crib sheet should be written out (no
mechanical or electronic reproductions are allowed). If you use a crib
sheet, you will be asked to turn it in with your test.
For those who missed lectures, copies of the slides are available on the WWW:
Material covered in discussion sections is also available on the WWW:
In addition to material covered in the lectures and discussion sections, you are responsible for the following chapters covered in the Kruse and Ryba textbook:
Ch. 2: 2.1, 2.2 Stacks
Ch. 3: 3.1-3.3 Queues
Ch. 4: 4.1-4.4 Linked Stacks and Queues
Ch. 6: 6.1, 6.2 Lists
Ch. 7: 7.1, 7.2, 7.6 Searching-Running Time Analysis (O-notation)
Ch. 8: 8.1-8.4, 8.6-8.9 Sorting
Ch. 9: 9.6 Hashing
Ch.10: 10.1-10.3 Trees
Ch.12: 12.1-12.4, 12.6 Graphs
and Ch. 12: 12.1-12.6 Templates from Deitel and Deitel.
Finally, you are responsible for material covered upto the midterm. For this, you can use the midterm study guide: