CSE 311 logo

CSE 311 Spring 2020
Foundations of Computing I

Lectures

Date Topic Reading
Mar 30 Propositional Logic 1.1
Apr 01 Equivalence and Circuits [html, pdf] 1.1-1.2
Apr 03 Equivalence and Proofs [html, pdf] 11.1-11.3
Apr 06 Boolean Algebra [html, pdf] 11.1-11.3
Apr 08 Canonical Forms and Predicate Logic [html, pdf] 1.3-1.4
Apr 10 Predicate Logic [html, pdf] 1.5-1.7
Apr 13 Inference Rules and Proofs for Propositional Logic [html, pdf] 1.5-1.7
Apr 15 Inference Rules and Proofs for Predicate Logic [html, pdf] 1.5-1.7
Apr 17 Proof Strategies [html, pdf] 1.5-1.7
Apr 20 Set Theory [html, pdf] 2.1-2.3
Apr 22 Modular Arithmetic [html, pdf] 3.4-3.6
Apr 24 Modular Arithmetic and Applications [html, pdf] 3.4-3.6
Apr 27 Primes and GCD [html, pdf] 3.5-3.7
Apr 29 Euclidean Algorithm and Modular Equations [html, pdf] 3.5-3.7
May 01 Modular Exponentiation and Induction [html, pdf] 3.7, 4.1
May 04 Induction [html, pdf] 4.1
May 06 Strong Induction [html, pdf] 4.2
May 08 Recursively Defined Functions and Sets [html, pdf] 4.3
May 11 Structural Induction [html, pdf] 4.3
May 13 Regular Expressions [html, pdf] pp. 817-819
May 15 Context-Free Grammars [html, pdf] pp. 790-793
May 18 Relations and Directed Graphs [html, pdf] 8.1, pp. 541-548
May 20 Finite State Machines (FSMs) [html, pdf]  
May 22 FSM Minimization and NFAs [html, pdf]  
May 25 Memorial Day (no class)  
May 27 Relating NFAs, DFAs, and Regular Expressions [html, pdf]  
May 29 Limitations of DFA, NFA, RegExp [html, pdf]  
Jun 01 Cardinality and Uncomputability [html, pdf] 12.5, p.177
Jun 03 Undecidability of the Halting Problem [html, pdf]  
Jun 05 Final Assignment (no class)