Week |
Dates |
Topic |
Slides |
PS |
01 |
Aug. 22 |
Course Introduction and Administrivia |
|
|
Aug. 24 |
Regular Languages: Deterministic Finite Automata (DFA) |
|
02 |
Aug. 29 |
In-Class Problem Solving Session 01 |
|
|
Aug. 31 |
Non-Deterministic Finite Automata (NFA) |
|
|
03 |
Sep. 05 |
|
Sep. 07 |
Closure Properties and Equivalence |
|
|
04 |
Sep. 12 |
Regular Expressions |
|
|
Sep. 14 |
Pumping Lemma and Non-Regular Languages |
|
|
05 |
Sep. 19 |
Context-Free Languages (CFL): |
|
|
Sep. 21 |
Context-Free Grammars |
|
|
06 |
Sep. 26 |
midterm exam i
|
Sep. 28 |
Push-Down Automata (PDA), Normal Forms |
|
|
07 |
Oct. 03 |
Pumping Lemma for CFL |
|
|
Oct. 05 |
CFL Properties and Equivalence |
|
|
08 |
Oct. 10 |
Recursively-Enumerable Languages (REL): |
|
|
Oct. 12 |
Recursive vs. REL |
|
|
09 |
Oct. 17 |
Turing Machines (TM) |
|
|
Oct. 19 |
|
|
10 |
Oct. 24 |
Halting Problem |
|
|
Oct. 26 |
midterm exam ii
|
11 |
Oct. 31 |
-- buffer space for fallover -- |
|
|
Nov. 02 |
Computational Complexity: Undecidability |
|
|
12 |
Nov. 07 |
Complexity Classes: P, NP, NP-C |
|
|
Nov. 09 |
P vs. NP |
|
|
13 |
Nov. 14 |
Satisfiability, Cook’s Theorem |
|
|
Nov. 16 |
Church-Turing Thesis |
|
|
14 |
Nov. 21 |
thanksgiving break
|
Nov. 23 |
15 |
Nov. 28 |
Topics in Cybersecurity |
|
|
Nov. 30 |
Topics in Cybersecurity |
|
|
16 |
Dec. 05 |
|
|
|
|
|
|
Dec. 07 |
|
|
|
|
|
|
17 |
Dec. 13 |
final Exam: 12:00 -- 01:40 p.m.
|