4003-380 Introduction to Computer Science Theory: Final Exam

When and Where

Thursday, November 17, 10:15am-12:15pm, room GOL(70)-1400 (the big auditorium on the first floor).


Wednesday, November 16, times 11am-12pm and 1:30-2:30pm, room GOL(70)-1610. If none of the times works for you, please let me know. If there is interest, I will try to arrange for an evening review session by Zach Langley (one of our CS theory tutors). Also, I will hold a review session for the Honors section at 12:30pm-1:30pm and you are welcome to come to that one if that fits better with your schedule.

Office Hours

Wednesday, November 16, right after the review sessions for 15 minutes to take care of any possible outstanding grading discrepancies
I will not hold my regular office hours during the finals week due to a scheduling conflict.


The tutoring schedule for finals week: Mon 1-4pm, Tue 2-4pm and 6-7pm, and Wed 1-4pm

The center will not follow the regular schedule.


Make sure that you handle all grading issues by Wednesday!


The emphasis of the final is on new stuff (described below) and on overview questions. You do need to know the main points of Chapter 1, but not the details. For example, you should know that NFAs are equivalent to DFAs, but you will not be required to apply the subset construction.

New stuff

You should have a good idea about the proofs from class but I will not ask you to reconstruct them. You might be asked to prove similar statements to those on the homeworks (e.g., apply the pumping lemma). As a general rule, you need to know only the material that we covered in class or was assigned on the homeworks. This mean the entire Chapter 2, Chapter 3, and Chapter 4. As for Chapters 5 and 7, you should know the material that was covered in class (see the slides).