<- previous    index     next ->

Lecture 30 Final Exam

  Closed book. Covers all lectures, all reading assignments, all homework
  and project. Multiple choice and short answer questions.

  1) go over the Quiz 1 and Quiz 2
     the final exam will include some of these questions
  2) You may find it helpful to go over the
     Lecture Notes  but not the details of constructions
  3) Understand what classes of languages go with what machines (automata)
     and grammars and regular expressions
  4) Understand the statement of the Pumping Lemma for Context Free Languages
  5) Understand the Halting Problem and why it is not computable
  6) Understand the Church Turing Hypothesis

    <- previous    index     next ->

Other links

Go to top