March | ||||
Monday | Tuesday | Wednesday | Thursday | Friday |
25
Lecture
Propositional Logic |
26 | 27
Lecture
Formalization and Circuits |
28
Section
Propositional Logic |
29
Lecture
Canonical Forms |
April | ||||
Monday | Tuesday | Wednesday | Thursday | Friday |
01
Lecture
Equivalences |
02 | 03
Lecture
Boolean Algebra
23:00 HW1 due
|
04
Section
Equivalences |
05
Lecture
Predicate Logic |
08
Lecture
Proofs for Propositional Logic |
09 | 10
Lecture
Proofs for Predicate Logic
23:00 HW2 due
|
11
Section
Proofs |
12
Lecture
English Proofs |
15
Lecture
Number Theory |
16 | 17
Lecture
Modular Arithmetic
23:00 HW3 due
|
18
Section
Number Theory |
19
Lecture
Primes and GCD |
22
Lecture
Euclidean Algorithm |
23 | 24
Lecture
Set Theory |
25
Section
Number and Set Theory |
26
Lecture
Set Theory and Induction
23:00 HW4 due
|
29
Lecture
Induction |
30 | 01
Lecture
Strong Induction and Recursive Data |
02
Section
Induction and Midterm Review |
03
Lecture
Recursive Functions and Structural Induction
23:00 HW5 due
|
May | ||||
Monday | Tuesday | Wednesday | Thursday | Friday |
06
Lecture
More Structural Induction |
07 | 08
10:30-11:20 Midterm exam (Section A)
13:30-14:20 Midterm exam (Section B)
|
09
Section
Advanced Induction |
10
Lecture
Regular Expressions (REs) |
13
Lecture
Context-Free Grammars (CFGs) |
14 | 15
Lecture
Relations and Directed Graphs
23:00 HW6 due
|
16
Section
Languages |
17
Lecture
Finite State Machines (FSMs) |
20
Lecture
FSM Minimization and NFAs |
21 | 22
Lecture
Relating DFAs, NFAs, and REs
23:00 HW7 due
|
23
Section
Finite State Machines |
24
Lecture
Limitations of DFAs, NFAs, and REs |
27
Memorial Day
|
28 | 29
Lecture
Cardinality and Uncomputability |
30
Section
Computability and Final review |
31
Lecture
Undecidability of the Halting Problem
23:00 HW8 due
|
June | ||||
Monday | Tuesday | Wednesday | Thursday | Friday |
03
12:30-14:20 Final exam
KNE 120 |
04 | 05 | 06 | 07 |