We will adjust this schedule as required.
All lectures will be at the scheduled times of 10:30-11:20 on Tuesdays and Thursdays. The lectures will be live-streamed on Zoom at the start of the term. We will return to in-person lectures, in MC 4041, when the university confirms that it is safe for us to do so.
The Midterm Assessment will cover the lecture material up to the end of 2021-02-11, and to the end of Crowdmark assignment 3.
There will be a Final Assessment due during the Final Exam period, which will cover the entire course.
| Week | Lectures | Assignments and Assessments | Module(s) | |
|---|---|---|---|---|
| Part 1 | Part 2 | |||
| 1: Jan 3–7 | N/A |
terminology, techniques of proof |
N/A |
1 |
|
2: Jan 10–14 |
finite automata Pre-read Module 2, up to slide 30 |
finite automata Pre-read Module 2, to the end |
Crowdmark Assignment 1 available |
2 |
|
3: Jan 17–21 |
regular languages and regular expressions Pre-read Module 3, up to slide 20 |
regular languages and regular expressions Pre-read Module 3, to the end |
Crowdmark Assignment 1 due Jan 19 at noon EST Marked Quiz 1 available |
3 |
| 4: Jan 24-28 |
properties of regular languages Pre-read Module 4, up to slide 28 |
properties of regular languages
Pre-read Module 4, to the end |
Marked Quiz 1 due Jan 26 at noon EST Crowdmark Assignment 2 available |
4 |
| 5: Jan 31–Feb 4 |
context-free grammars and languages Pre-read Module 5, up to slide 25 |
context-free grammars and languages Pre-read Module 5, up to slide 43 |
Crowdmark Assignment 2 due Feb 2 at noon EST Marked Quiz 2 available |
5 |
| 6: Feb 7–11 |
context-free grammars and languages Pre-read Module 5, up to the end |
pushdown automata Pre-read Module 6, up to slide 21 |
Marked Quiz 2 due Feb 9 at noon EST Crowdmark Assignment 3 available |
5 |
| 7: Feb 14-18 | pushdown automata
Pre-read Module 6, up to slide 46 |
pushdown automata
Pre-read Module 6, up to slide 57 |
Crowdmark Assignment 3 due Feb 16 at noon EST Midterm Assessment Feb 17, 18:00-19:30 Marked Quiz 3 available |
6 |
| Reading Week: Feb 21–25 | N/A | N/A | N/A | N/A |
| 8: Feb 28–March 4 | pushdown automata
Pre-read Module 6, up to the end |
properties of context-free languages
Pre-read Module 7, up to slide 19 |
Marked Quiz 3 due March 2 at noon EST Crowdmark Assignment 4 available |
6, 7 |
| 9: March 7–11 | properties of context-free languages
Pre-read Module 7, up to slide 37 |
properties of context-free languages
Pre-read Module 7, up to the end |
Crowdmark Assignment 4 due March 9 at noon EST Marked Quiz 4 available |
7 |
| 10: March 14–18 | introduction to Turing machines
Pre-read Module 8, up to slide 19 |
introduction to Turing machines
Pre-read Module 8, up to slide 30 |
Marked Quiz 4 due March 16 at noon EDT Crowdmark Assignment 5 available |
8 |
| 11: March 21–25 | introduction to Turing machines
Pre-read Module 8, up to slide 46 |
introduction to Turing machines
Pre-read Module 8, up to the end |
Crowdmark Assignment 5 due March 23 at noon EDT Marked Quiz 5 available |
8 |
| 12: March 28–April 1 | undecidability
Pre-read Module 9, up to slide 24 |
undecidability
Pre-read Module 9, up to slide 49 |
Marked Quiz 5 due March 30 at noon EDT Crowdmark Assignment 6 available |
9 |
| 13: April 4–8 | undecidability
Pre-read Module 9, up to the end |
N/A |
Crowdmark Assignment 6 due April 5 at 11:59 PM EDT |
9 |