Exam Study Guide, Math 421, Fall 2021

More content and corrections may be added to this page.

Examinable Material for Midterm 2021
  1. The first two handouts to supplement the textbook:
    1. Self-Referencing, Uncountability and Uncomputability in CPSC 421;
    2. this article on the Myhill-Nerode theorem.
  2. Sipser's Textbook:
    • Chapter 1, excluding the Pumping Lemma in 1.4, and the (mostly) theoretical direction of 1.3 (DFA/NFA to regular expression).
Practice Problems for the Midterm 2021 All homework problems are good exam study problems. For the questions that refer to Turing machines but involve a regular language, write an efficient DFA and/or NFA for the langugages in question. Turing machines (Chapter 3 of [Sip]) will not be examined on this year's midterm.
  1. Midterm 2019. (solutions).
  2. The 2020 Midterm of 9:30am, the 2020 Midterm of 8:30pm (solutions to both).
  3. Midterm 2014, Problems 1,2(b,c,d) (solutions).
  4. Midterm 2011, Problems 1,3 (solutions).
  5. Final 2011, Problems 1,2,8. (No solutions provided.)
In addition, here are some SUPPLEMENTAL problems based on the material NEW as of 2021: Supplemental Practice for the 2021 Midterm
Grading Scheme for Exams To get an idea of how your exam will be graded, here are the marking schemes from the 2020 Exams: Final_2020_Part1.pdf , Final_2020_Part2.pdf , Midterm_2020_9_30am.pdf

UBC CS Home| Joel Friedman Home| Course Materials