CSE 311 Winter 2025 Schedule

January
MondayTuesdayWednesdayThursdayFriday
06
10:30-11:20 Lecture
CSE2 G20
Propositional Logic
07 08
10:30-11:20 Lecture
CSE2 G20
Canonical Forms
09
Section
Propositional Logic
10
10:30-11:20 Lecture
CSE2 G20
Circuits
13
10:30-11:20 Lecture
CSE2 G20
Equivalences
14 15
10:30-11:20 Lecture
CSE2 G20
Predicate Logic
23:00 HW1 due
16
Section
More Logic
17
10:30-11:20 Lecture
CSE2 G20
Proofs for Propositional Logic
20
MLK Day
21 22
10:30-11:20 Lecture
CSE2 G20
Proofs for Predicate Logic
23:00 HW2 due
23
Section
Proofs
24
10:30-11:20 Lecture
CSE2 G20
English Proofs
27
10:30-11:20 Lecture
CSE2 G20
Modular Arithmetic
28 29
10:30-11:20 Lecture
CSE2 G20
Modular Equations
23:00 HW3 due
30
Section
Number Theory
31
10:30-11:20 Lecture
CSE2 G20
Euclidean Algorithm
February
MondayTuesdayWednesdayThursdayFriday
03
10:30-11:20 Lecture
CSE2 G20
Induction
04 05
10:30-11:20 Lecture
CSE2 G20
Strong Induction
23:00 HW4 due
06
Section
Induction
07
10:30-11:20 Lecture
CSE2 G20
Applications of Number Theory
10
10:30-11:20 Lecture
CSE2 G20
Set Theory
11 12
10:30-11:20 Lecture
CSE2 G20
Product and Power Sets
23:00 HW5 due
13
Section
Midterm Review
14
10:30-11:20 Lecture
CSE2 G20
Recursively-Defined Sets and Functions
17
President's Day
18 19
10:30-11:20 midterm exam
20
Section
Set Theory
21
10:30-11:20 Lecture
CSE2 G20
Structural Induction
24
10:30-11:20 Lecture
CSE2 G20
REs
25 26
10:30-11:20 Lecture
CSE2 G20
CFGs
23:00 HW6 due
27
Section
Languages
28
10:30-11:20 Lecture
CSE2 G20
Relations and Graphs
March
MondayTuesdayWednesdayThursdayFriday
03
10:30-11:20 Lecture
CSE2 G20
Finite State Machines
04 05
10:30-11:20 Lecture
CSE2 G20
Minimization & NFAs
23:00 HW7 due
06
Section
FSMs
07
10:30-11:20 Lecture
CSE2 G20
Relating DFAs, NFAs, & REs
10
10:30-11:20 Lecture
CSE2 G20
Limitations of DFAs, NFAs, & REs
11 12
10:30-11:20 Lecture
CSE2 G20
Cardinality & Uncomputability
13
Section
Final Review
14
10:30-11:20 Lecture
CSE2 G20
Undecidability of the Halting Problem
23:00 HW8 due
17
08:30-10:20 Final exam
18 19 20 21