Disclaimer: I have attempted to be comprehensive in the following, but important items may have been omitted by mistake. If you see such an omission, please let me know, but you are responsible for all of the lecture material to date.
The final exam for CSci 370 is scheduled for Friday, December 14, 8:00 AM - 10:00 AM. It will be a mandatory, two-hour, in class, comprehensive exam. University regulations require that all students take the final exam at this date and time. The exam will be held in our usual classroom (Thompson 383)., and will cover chapters 1 - 4 and chapter 7 (through the definition of NP-Completeness in section 7.4, skipping chapters 5 and 6) of the textbook.
In your review, please review exam review documents for the preceding hour exams, homework assignments, and class notes (available on Moodle). Since our third hour exam we have discussed decidability and undecidability and the notions of polynomial class Turing Machines (the class P), the class NP, and have been briefly introduced to NP completeness.
In particular, be prepared to do the following from the new material:
It may be useful in your review to examine problems 7.1 - 7.7 on page 322.