CSE 311 Spring 2012
Course Calendar

Subscribe to this calendar (google, iCal, etc.)

 Show color key
In reading assignments below, section numbers refer to the Rosen textbook and are given for both the 7th and 6th editions.

March
MondayTuesdayWednesdayThursdayFriday
26
13:30-14:20 Lecture
MUE 153
Propositions; ¬, ∧, ∨, →
1.1-1.3 (7th), 1.1-1.2 (6th)
15:00-16:00 OH (MZ)
CSE 216
27
13:00-14:00 OH (MT)
CSE 538
28
HW1 out
11:00-12:00 OH (DG)
CSE 216
13:30-14:20 Lecture
MUE 153
Truth tables, ↔, logical equivalence
29
Section
Propositional logic. Logical implication
Worksheet / Answers
30
13:30-14:20 Lecture
MUE 153
Logical equivalences, disjunctive normal form
14:30-15:20 OH (NK)
CSE 216

April
MondayTuesdayWednesdayThursdayFriday
02
13:30-14:20 Lecture
MUE 153
Complexity of proving tautologies; predicates, quantifiers
1.4-1.5 (7th), 1.3-1.4 (6th)
15:00-16:00 OH (MZ)
CSE 216
03
13:00-14:00 OH (MT)
CSE 538
04
HW2 out
11:00-12:00 OH (DG)
CSE 216
13:30 HW1 due
13:30-14:20 Lecture
MUE 153
Nested quantifiers, logical equivalences
05
Section
Logical equivalence, Quantifiers
Worksheet / Answers
06
13:30-14:20 Lecture
MUE 153
Sets: ∈, ⊆, =, power set; first proofs
2.1-2.2
14:30-15:20 OH (NK)
CSE 216
09
13:30-14:20 Lecture
MUE 153
Cartesian product, ∪, ∩, −
15:00-16:00 OH (MZ)
CSE 216
10
13:00-14:00 OH (MT)
CSE 538
11
HW3 out
13:30 HW2 due
13:30-14:20 Lecture
MUE 153
Functions: injective, surjective
2.3
15:30-16:30 OH (MZ)
CSE 216
12
Section
Sets
Worksheet / Answers can be found in the textbook.
13
13:30-14:20 Lecture
MUE 153
bijective, inverse, composition
14:30-15:20 OH (NK)
CSE 216
16
13:30-14:20 Lecture
MUE 153
Divisibility, primes, Fundamental Theorem, Division Theorem
4.1&4.3 (7th), 3.4-3.5 (6th)
15:00-16:00 OH (MZ)
CSE 216
17
13:00-14:00 OH (MT)
CSE 538
18
HW4 out
11:00-12:00 OH (DG)
CSE 216
13:30 HW3 due
13:30-14:20 Lecture
MUE 153
Modular arithmetic
19
Section
Modular arithmetic
Worksheet / Answers to Problem 2: a) -11 b) -14 c) 94 (The rest can be found in the textbook)
20
13:30-14:20 Lecture
MUE 153
Modular exponentiation; GCD, Euclid's algorithm
End of 4.2 (7th), 3.6 (6th)
14:30-15:20 OH (NK)
CSE 216
23
13:30-14:20 Lecture
MUE 153
Properties of gcd; proof by contradiction
15:00-16:00 OH (MZ)
CSE 216
24
13:00-14:00 OH (MT)
CSE 538
25
11:00-12:00 OH (DG)
CSE 216
13:30-14:20 Lecture
MUE 153
RSA cryptosystem
Slides
26
Section
Various material involving past homework, proof by contradiction and the RSA scheme
27
HW5 out
13:30 HW4 due
13:30-14:20 Lecture
MUE 153
Digital signatures, coin-flipping; induction
14:30-15:20 OH (NK)
CSE 216
30
13:30-14:20 Lecture
MUE 153
Induction, correctness of Euclid's algorithm
5.1 (7th), 4.1 (6th)
15:00-16:00 OH (MZ)
CSE 216
01
13:00-14:00 OH (MT)
CSE 538
02
11:00-12:00 OH (DG)
CSE 216
13:30-14:20 Lecture
MUE 153
Strong induction
5.2 (7th), 4.2 (6th)
03
Section
Assorted problems for review
Worksheet
04
HW6 out
13:30 HW5 due
13:30-14:20 Lecture
MUE 153
Recursive definitions
5.3 (7th), 4.3 (6th)
14:30-15:20 OH (NK)
CSE 216

May
MondayTuesdayWednesdayThursdayFriday
07
13:30-14:20 Lecture
MUE 153
Midterm exam
13:30-14:20 Midterm exam
15:00-16:00 OH (MZ)
CSE 216
08
13:00-14:00 OH (MT)
CSE 538
09
11:00-12:00 OH (DG)
CSE 216
13:30-14:20 Lecture
MUE 153
Relations
9.1 (7th), 8.1 (6th)
10
Section
Induction
Worksheet / Answers
11
13:30-14:20 Lecture
MUE 153
Equivalence relations
9.5 (7th), 8.5 (6th)
14:30-15:20 OH (NK)
CSE 216
14
13:30 HW6 due
13:30-14:20 Lecture
MUE 153
Graphs, Boolean functions
10.1, 10.4, 12.1 (7th), 9.1, 9.4, 11.1 (6th)
15:00-16:00 OH (MZ)
CSE 216
15
13:00-14:00 OH (MT)
CSE 538
16
HW7 out
11:00-12:00 OH (DG)
CSE 216
13:30-14:20 Lecture
MUE 153
Normal forms, circuits, ripple-carry adder
12.2-12.3 (7th), 11.2-11.3 (6th)
17
Section
Homework 6 discussion, carry look-ahead adder
Worksheet
18
13:30-14:20 Lecture
MUE 153
Finite-state machines
13.2 (7th), 12.2 (6th)
14:30-15:20 OH (NK)
CSE 216
21
13:30-14:20 Lecture
MUE 153
Finite-state automata
13.3 (7th), 12.3 (6th)
15:00-16:00 OH (MZ)
CSE 216
22
13:00-14:00 OH (MT)
CSE 538
23
HW8 out
11:00-12:00 OH (DG)
CSE 216
13:30 HW7 due
13:30-14:20 Lecture
MUE 153
Regular expressions
13.4 (7th), 12.4 (6th)
24
Section
Pumping lemma
25
13:30-14:20 Lecture
MUE 153
Kleene's Theorem
14:30-15:20 OH (NK)
CSE 216
28
Memorial Day
29
13:00-14:00 OH (MT)
CSE 538
30
11:00-12:00 OH (DG)
CSE 216
13:30 HW8 due
13:30-14:20 Lecture
MUE 153
Halting problem
3.1
31
Section
Final exam review
Final Review / Answers
01
13:30-14:20 Lecture
MUE 153
Turing machines, undecidability
13.5 (7th), 12.5 (6th)
14:30-15:20 OH (NK)
CSE 216

June
MondayTuesdayWednesdayThursdayFriday
04
14:30-16:20 Final exam
05 06 07 08