| Instructor |
|---|
| General Information |
|---|
| Overview |
|---|
| Section | Time | Location |
|---|---|---|
|
|
Mon/Wed/Fri 1:00 PM - 1:50 PM | O'Connell Center 241 |
| Objectives |
|---|
| Week(s) | Topics |
|---|---|
|
|
M1. Regular Languages, Finite Automata |
|
|
M1. Nondeterminism |
|
|
M1. Pumping Lemma Homework 1 Due |
|
|
Exam 1 M2. Context-free Languages |
|
|
M2. Pushdown Automata |
|
|
M2. Pumping Lemma for CFL's Homework 2 Due |
|
|
Exam 2 M3. Turing Machines |
|
|
M3. Decidable Languages, Halting Problem |
|
|
Homework 3 Due M4. Complexity Classes |
|
|
Exam 3 M4. Reductions and NP-Hard Problems |
|
|
M4. Graph Theory and NP-Completeness Oracles and Reductions Labs Due Gadgets Homework Due Exam 4 |
| Materials |
|---|
![]() |
Textbook |
| Grading |
|---|
| Regrade Policy |
|---|
| Incomplete Grade Policy |
|---|
| Academic Dishonesty |
|---|
| Accomodations |
|---|