4003-389 Honors Introduction to Computer Science Theory: Final Exam

When and Where

Thursday, November 15, 12:30am-2:30pm, room GOL(70)-3560.

Review

Wednesday, November 15, 6-8pm, room TBA.

Office Hours

Wednesday, November 16, right after the review session 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.

Tutoring

The tutoring schedule for finals week: will be posted here
The center will not follow the regular schedule.

Topics

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 except for deterministic CFLs, and Chapter 4. As for Chapters 5 and 7, you should know the material that was covered in class (see the slides).

Notes