CSE 311: Foundations of Computing I, Spring 2023

Schedule

For future lectures, this is a tentative schedule. The exact contents are subject to change. Links to future materials may also be broken.

Week 1
Topic
Week 1
Lecture 1
(Mon, Mar 27)
Propositional Logic
Lecture 2
(Wed, Mar 29)
Equivalences
Section 1
(Thu, Mar 30)
Propositional Logic & Equivalences
Lecture 3
(Fri, Mar 31)
Circuits
Week 2
Lecture 4
(Mon, Apr 3)
Boolean algebra, Canonical Forms
Lecture 5
(Wed, Apr 5)
Canonical Forms, Predicate Logic
Section 2
(Thu, Apr 6)
Circuits & Predicate Logic
Lecture 6
(Fri, Apr 7)
Predicate Logic, Inference
Week 3
Lecture 7
(Mon, Apr 10)
Propositional & Predicate Logic Proofs
Lecture 8
(Wed, Apr 12)
Predicate Logic Proofs, English Proofs
Section 3
(Thu, Apr 13)
Predicate Logic, Proofs
Lecture 9
(Fri, Apr 14)
English Proof Strategies, Number Theory
Week 4
Lecture 10
(Mon, Apr 17)
Modular Arithmetic
Lecture 11
(Wed, Apr 19)
Applications of Modular Arithmetic, Prime Factorization, GCD
Section 4
(Thurs, Apr 20)
Number Theory
Lecture 12
(Fri, Apr 21)
Modular Equations, Exponentiation, Set Theory
Week 5
Lecture 13
(Mon, Apr 24)
Set Theory
Section 5
(Thu, Apr 27)
Modular Exponentiation, Set Theory, Induction
Lecture 15
(Fri, Apr 28)
Strong Induction and Recursion
Week 6
Lecture 16
(Mon, May 1)
Recursively Defined Sets and Structural Induction
Lecture 17
(Wed, May 3)
More Structural Induction
Section 6
(Thu, May 4)
Induction: Ordinary, Strong, Structural
Lecture 18
(Fri, May 5)
Strings and Regular Expressions
Week 7
Lecture 19
(Mon, May 8)
Context-Free Grammars (CFGs)
Midterm
(Wed, May 10)
Midterm
Section 7
(Thurs, May 11)
Induction, Regular Expressions
Lecture 20
(Fri, May 12)
CFGs and Relations
Week 8
Lecture 21
(Mon, May 15)
Directed Graphs, Finite State Machines (FSMs)
Lecture 22
(Wed, May 17)
Finite State Machine Design
Section 8
(Thurs, May 18)
CFGs, Relations, Finite State Machines
Lecture 23
(Fri, May 19)
Minimization, NFAs
Week 9
Lecture 24
(Mon, May 22)
NFAs, RegExp, NFAs to DFAs
Lecture 25
(Wed, May 24)
The Limitations of DFA/NFA/RegExp
Section 9
(Thurs, May 25)
FSM Minimization, NFAs, Subset Construction, Irregularity
Lecture 26
(Fri, May 26)
Cardinality, Uncomputability
Week 10
(Mon, May 29)
No Lecture: Memorial Day
Lecture 27
(Wed, May 31)
Undecidability of the Halting Problem
Section 10
(Thu, Jun 1)
Review
Lecture 28
(Fri, Jun 2)
Turing Machines and Reductions
Exam Week
Final Exam
(Mon, Jun 5)
Final exams are scheduled at 2:30-4:20 pm and 4:30-6:20 pm in JHN 102 rather than our regular classroom.
(You will need to select one of these two times to take your exam and confirm your choice by Saturday June 3.)

This course website heavily follows the example of the website of CSE373 2019 Spring.