Adam Blank 
()

Announcements

Information

Welcome to CSE 311! You might want to start by looking at the course policies in the . If you want more detail on tokens, you should read the . You could also peruse the . Or you could view our .

We will have two optional textbooks this quarter (this is the standard textbook for this course) and (this is a "guide to proofs").
You might also find useful. As the get closer we will post more information about them.

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.

Office Hours

All TA Office Hours are held in CSE 021. Adam's Office Hours are held in CSE 444.

Monday

  • 12:00pm 1:00pm
    (Evan/Johan)
  • 3:00pm 4:00pm
    (Jasper/Logan)
  • 6:30pm 7:30pm
    (CSE 444; Adam)

Tuesday

  • 11:30am 12:30pm
    (Melissa/Ollin)
  • 1:00pm 3:00pm
    (CSE 444; Adam)
  • 4:30pm 5:30pm
    (Michael/Ollin)

Wednesday

  • 12:00pm 1:00pm
    (Evan/Johan)
  • 4:00pm 5:00pm
    (Matthew/Logan)
  • 5:00pm 6:00pm
    (Jack/Jefferson)
  • 6:00pm 7:00pm
    (Emerson/Jefferson)

Thursday

  • 4:00pm 5:00pm
    (Matthew/Melissa)
  • 5:00pm 7:00pm
    (WORKSHOP!)

Friday

  • 10:30am 11:30am
    (Emerson/Jack)
  • 2:30pm 4:30pm
    (CSE 444; Adam)
  • 6:00pm 7:00pm
    (Michael)

Sunday

  • 1:00pm 2:00pm
    (Melissa)

Course Staff

Instructor

Adam Blank
CSE 444
(206) 616-0034

Teaching Assistants

Jack Armstrong
jackarms
AD
Ollin Boer Bohan
ollin
Yay!
Phillip Huang
phuang2
AC
Jasper Hugunin
jasperh
AB
Michael Lee
mlee42
AE
Emerson Matson
emersonn
AD
Evan McCarty
ejmcc
AA
Melissa Medsker
medskm
AB
Johan Michalove
michajoh
Infrastructure
Matthew Rockett
rockettm
AA
Jefferson Van Wagenen
jgdv
AC
Logan Weber
weberlo
Yay!

Schedule

  • Logic
  • Boolean Algebra & Circuits
  • Proofs
  • Number Theory
  • Induction
  • More Induction
  • Regexps & CFGs
  • FSMs
  • Limits of Computation
  • Cardinality

Proofs

Reference

#
Day
Topic
Homework
Propositional Logic
Syllabus, 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; Velleman 1.1-1.2, 1.5
Logic
Circuits & More Logical Equivalences
Rosen 12.1-12.3 (7th), 11.1-11.3 (6th)
Boolean Algebra, Circuits, Canonical Forms
Rosen 12.1-12.3 (7th), 11.1-11.3 (6th)
Predicate Logic
Rosen 1.4-1.5 (7th), 1.3-1.4 (6th)
Equivalences & Predicate Logic
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), Read me!
First-Order Logic & Inferences
More Proofs & Set Theory
Rosen 2.1-2.3 (6th, 7th), Please?
More Set Theory & Modular Arithmetic
Rosen 4.1-4.2 (7th), 3.4-3.5 (6th)
Modular Arithmetic & Applications
Rosen 4.1-4.3 (7th), 3.4-3.6 (6th)
Sets & Modular Arithmetic
Primes & GCD
Rosen 4.3-4.4 (7th), 3.5-3.7 (6th)
Euclidean Algorithm & Solving Modular Equations
Rosen 4.4, 5.1 (7th), 3.7, 4.1 (6th)
Induction
Rosen 5.1 (7th), 4.1 (6th)
Induction
Strong Induction I
Rosen 5.2-5.3 (7th), 4.2-4.3 (6th)
Strong Induction II
Rosen 5.3 (7th), 4.3 (6th)
Midterm Exam

Information & Practice Exams

  • 4:30pm
    6:00pm in JHN 102
Strong Induction
Structural Induction
Rosen 5.3 (7th), 4.3 (6th)
Structural Induction & Regular Expressions
Context-Free Grammars
Structural Induction & Regular Expressions
Finite State Machines
FSMs With Output
DFA Minimization & NFAs
CFGs & FSMs
NFAs ≡ DFAs ≡ Regular Expressions
Limits of FSMs
Limits of Programs
NFAs, Minimization, Irregular Languages
Cardinality
Memorial Day: No Class!
Graphs & Relations
Relations & Cardinality
Undecidability & Victory Lap
Final Exam

Information & Practice Exams

  • 2:30pm
    4:20pm in JHN 102