Course Schedule
Class meets TTh 4 - 6:30 PM in CoDa B80, with recordings posted to Canvas for later asynchronous viewing. This is a preview of our planned schedule. We will update this schedule as we go. This page should faithfully describe the past, but it won't always accurately predict the future.
- 1
Jun 23
Set Theory and Introduction to ProofsJun 25
More Applications of Proofs, plus Negations-
Problem Set 0
due Friday 1pm - 2
Jun 30
Propositional Logic and Existential & Universal QuantifiersJul 2
More Propositional Logic and Functions-
Problem Set 1
due Thurs 1pm - 3
Jul 7
Functions and GraphsGuide to Proofs on Discrete Structures, Guide to Proofs on Sets, Discrete Structures Proofwriting Checklist
Jul 9
Proofs about Graphs and Pigeonhole Principle-
Problem Set 2
due Thurs 1pm - 4
Jul 14
Induction Part 1 (plus live midterm review)Jul 16
Induction Part 2 (plus live midterm review)-
Problem Set 3
due Thurs 1pm - 5
Jul 21
Midterm, 3 – 6pm, CoDa B80Jul 23
Finite Automata-
Problem Set 4
due Thurs 1pm - 6
Jul 28
More Finite Automata and Regular ExpressionsJul 30
Converting NFAs to Regular Expressions-
Problem Set 5
due Thurs 1pm - 7
Aug 4
CFGs and Intro to Turing MachinesAug 6
Turing Machines and R vs RE-
Problem Set 6
due Thurs 1pm - 8
Aug 11
Decidability and The Halting ProblemAug 13
P vs NP and Complexity Theory-
Problem Set 7
due Thurs 1pm
Exams
- Midterm: Tuesday, July 21, 3:00 – 6:00 PM
- Final Exam: Saturday, August 15, 3:30 – 6:30 PM