CSE 311 Spring 2025 Schedule

March
MondayTuesdayWednesdayThursdayFriday
31
Lecture
Propositional Logic
01 02
Lecture
Canonical Forms
03
Section
Propositional Logic
04
Lecture
Circuits
April
MondayTuesdayWednesdayThursdayFriday
07
Lecture
Equivalences
23:00 HW0 due
08 09
Lecture
Predicate Logic
23:00 HW1 due
10
Section
More Logic
11
Lecture
Proofs for Propositional Logic
14
Lecture
Proofs for Predicate Logic
15 16
Lecture
More Formal Proofs
23:00 HW2 due
17
Section
Proofs
18
Lecture
English Proofs
21
Lecture
Modular Arithmetic
22 23
Lecture
More Modular Arithmetic
23:00 HW3 due
24
Section
Number Theory
25
Lecture
Euclidean Algorithm
28
Lecture
Induction
29 30
Lecture
Strong Induction
23:00 HW4 due
01
Section
Induction
02
Lecture
Applications of Number Theory
May
MondayTuesdayWednesdayThursdayFriday
05
Lecture
Set Theory
06 07
Lecture
Product and Power Sets
23:00 HW5 due
08
Section
Midterm Review
09
Lecture
Recursively-Defined Sets
12
Lecture
Structural Induction
13 14
10:30-11:20 Midterm exam
SIG 134
13:30-14:20 Midterm exam
CSE2 G01
15
Section
Set Theory
16
Lecture
REs
19
Lecture
CFGs
20 21
Lecture
Relations and Graphs
23:00 HW6 due
22
Section
Languages
23
Lecture
Finite State Machines
26
Memorial Day
27 28
Lecture
NFA, DFAs, & REs
23:00 HW7 due
29
Section
State Machines
30
Lecture
Limitations of DFAs, NFAs, & REs
June
MondayTuesdayWednesdayThursdayFriday
02
Lecture
Cardinality & Computability
03 04
Lecture
Undecidability of the Halting Problem
05
Section
Final Review
23:00 HW8 due
06
Lecture
Reductions
09
12:30-14:20 Final exam
KNE 120
10 11 12 13