Adam Blank 
()

Welcome to CSE 311! We have put the most important links at the top, categorized by what they're for. Please check them out!

Events

Getting Help

It is very important to us that you succeed in CSE 311. We provide many extra resources to help you. Adam and the TAs hold many office hours, we have a message board called , and we provide you with many practice handouts.

Course Staff

Instructor

CSE 444
(206) 616-0034

Course Mascot

Hopper
Ruffff!

Teaching Assistants

Schedule

  • Logic
  • Boolean Algebra & Circuits
  • Proofs
  • Number Theory
  • Induction
  • More Induction
  • Regexps & CFGs
  • FSMs
  • Limits of Computation
  • Cardinality
 
#
Day
Topic
Homework
Propositional Logic
Syllabus, How To Ask For Help, Grading Guidelines, Lockhart's Lament, Rosen 1.1-1.2 (7th), 1.1 (6th); MCS 1.1, 3.1-3.2; Velleman 1.1-1.2, 1.5
Logical Equivalence & Digital Circuits
Rosen 1.1-1.3 (7th), 1.1-1.2 (6th); MCS 3.3,3.4.2; Velleman 1.1-1.2, 1.5
Logical Equivalence Proofs & Boolean Algebra
Rosen 12.1-12.3 (7th), 11.1-11.3 (6th)
Circuits & Canonical Forms
Rosen 12.1-12.3 (7th), 11.1-11.3 (6th); MCS 3.4.1
Predicate Logic
Rosen 1.4-1.5 (7th), 1.3-1.4 (6th); MCS 1.2, 3.6; Velleman 2.1-2.2
More Predicate Logic
Rosen 1.6-1.7 (7th), 1.5-1.7 (6th)
Proofs I
Rosen 1.6-1.7 (7th), 1.5-1.7 (6th); Hello!
Proofs II
Rosen 1.6-1.7 (7th), 1.5-1.7 (6th); MCS 1.5-1.8; Velleman 3.1-3.5; Read me!
Rationals, Sets, Modular Arithmetic
Rosen 2.1-2.3 (6th, 7th); MCS 4.1; Velleman 1.3-1.4, 2.3, 4.1; Please?
Proofs III
Rosen 4.1-4.2 (7th), 3.4-3.5 (6th); MCS 9.1, 9.6
Proofs IV
Rosen 4.1-4.3 (7th), 3.4-3.6 (6th); MCS 9.4
Primes & GCD
Rosen 4.3-4.4 (7th), 3.5-3.7 (6th); MCS 9.2
Arbitrary-Precision Numbers & Induction
Rosen 4.4, 5.1 (7th), 3.7, 4.1 (6th)
Induction
Rosen 5.1 (7th), 4.1 (6th); MCS 5.1; Velleman 6.1-6.3
Strong Induction I
Rosen 5.2-5.3 (7th), 4.2-4.3 (6th); MCS 5.2; Velleman 6.4
Structural Induction
Rosen 5.3 (7th), 4.3 (6th); MCS 7.1-7.4
Structural Induction & Regular Expressions
Context-Free Grammars
Finite State Machines
FSMs With Output
DFA Minimization & NFAs
NFAs ≡ DFAs ≡ Regular Expressions
POMSC Office Hours
Limits of FSMs
Limits of Programs
Graphs & Relations
Velleman 4.2, 4.5
Cardinality
MCS 4.5, 8.1; Velleman 5.1-5.2, 7.1-7.2
TBD
Undecidability & Victory Lap