MCS 265: Theory of Computing (Spring 2015)

Tentative Reading and Test Schedule


Keep in mind, this page is a work in progress. It was last updated on 1/28/15.

Week Dates Monday Tuesday Thursday Friday
1 2/9-2/13 Review
Chapter 0
Problem day BK out Finite automata
1.1
2 2/16-2/20 Regular languages
1.1
Cont. Nondeterminism
1.2
Cont.
3 2/23-2/27 Problem day Regular expressions
1.3
Non-regular languages
1.3, 1.4
Cont.
4 3/2-3/6 Pumping lemma
1.4
Cont. Context-free grammars
2.1
Chomsky normal form
2.1
5 3/9-3/13 Pushdown automata
2.2
Cont. Equivalence of PDA and CFL Cont.
6 3/16-3/20 Problem day Pumping lemma for CFL's Non-context-free languages
2.3
Review, catch up
7 3/23-3/27 Review Test #1 Turing machines
3.1
Cont.
8 3/30-4/3 Spring break; no class Spring break; no class Spring break; no class Spring break; no class
9 4/6-4/10 Spring break; no class Turing machines
3.1
Cont. Cont.
10 4/13-4/17 Variants of Turing machines
3.2
Cont. Decidable languages
4.1
11 4/20-4/26 Decidable languages
4.1
Cont. Halting problem
4.2
Undecidable problems
5.1
12 4/27-5/1 5.1 cont. Mapping reducible
5.3
Review/catch up Test #2
13 5/4-5/8 Complexity theory
7.1
Cont. The class P
7.2
Cont.
14 5/11-5/15 The class NP
7.3
Continued Polynomial time reducibility NP-completeness
7.4
15 5/18-5/22 Cont. Review

Final: Tuesday, May 26, 1:00 -3:00pm