Reading assignments are from Barrington: A Mathematical Foundation for Computer Science (draft), available at cost from Collective Copies in downtown Amherst.
Class meetings are MWF 1:25-2:15 in Bartlett Hall room 65. There are five discussion sections, each meeting on Fridays. Section AA meets at 10:10 in ELAB 323, Section AB at 9:05 in ELAB 323, Section AC at 10:10 in Flint 105, Section AD at 10:10 in Flint 105, and Section AE at 12:20 in ELAB 304. There are two evening exams, as indicated, and two discussion sections are cancelled to compensate for the extra time.
PART I: Logic and Number Theory
Mon 22 Jan L01 Sets and Strings (1.1, 1.2)
Wed 24 Jan L02 Propositions and Boolean Operations (1.4)
Fri 26 Jan D01 What is a Proof? (1.3)
Fri 26 Jan L03 Set Operations and Truth Tables (1.5, 1.6)
Mon 29 Jan L04 Rules for Propositional Proofs (1.7)
Wed 31 Jan L05 Propositional Proof Strategies (1.8)
Fri 02 Jan D02 A Murder Mystery (1.9)
Fri 02 Feb L06 Predicates and Relations (1.10, 2.1)
Mon 05 Feb L07 Quantifiers and Languages (2.3, 2.5) (END OF ADD/DROP)
Wed 07 Feb L08 NO CLASS (SNOW)
Fri 09 Feb D03 Translating Quantifiers (2.4)
Fri 09 Feb L08 Proofs With Quantifiers (2.6)
Mon 12 Feb L09 Relations and Functions (2.8, 2.9)
Wed 14 Feb L10/11 Equivalence Relations and Partial Orders (2.10, 2.11)
Fri 16 Feb D04 Practicing Proofs (2.7)
Fri 16 Feb L12 Divisibility and Primes (3.1)
Mon 19 Feb --- NO CLASS (President's Day Holiday)
Wed 21 Feb L13 Modular Arithmetic (3.3)
Fri 23 Feb D05 Infinitely Many Primes (3.4)
Fri 23 Feb L14 The Chinese Remainder Theorem (3.5)
Mon 26 Feb L15 The Fundamental Theorem of Arithmetic (3.6)
Mon 26 Feb X01 FIRST MIDTERM (7-9 p.m., Bartlett 65 and Goessmann 20)
on Lectures 1-15
PART II: Induction, Trees, and Searching
Wed 28 Feb L16 Recursive Definition (4.1)
Fri 02 Mar --- NO DISCUSSION (makeup for exam)
Fri 02 Mar L17 Proof by Induction for Naturals (4.3)
Mon 05 Mar L18 Variations on Induction for Naturals (4.4)
Wed 07 Mar L19 NO CLASS (SNOW)
Wed 07 Mar --- Last Day to Drop With W or Elect Pass/Fail
Fri 11 Mar D06 Practicing Induction Proofs (not in book)
Fri 11 Mar L19 Proving the Basic Facts of Arithmetic (4.6)
SPRING BREAK
Mon 19 Mar L20/21 Strings, Induction for Problem Solving (4.7, 4.11)
Wed 21 Mar L22 Graphs, Paths, and Trees (4.9, 9.1)
Fri 23 Mar D07 More Induction Practice (not in book)
Fri 23 Mar L23 Recursion on Trees (9.3)
Mon 26 Mar L24 General, Breadth-First, and Depth-First Search (9.4, 9.5)
Wed 28 Mar L25 BFS and DFS on Graphs (9.6)
Fri 30 Mar D08 Boolean Expression Trees (9.2)
Fri 30 Mar L26 Uniform-Cost and A* Search (9.8, 9.9)
Mon 02 Apr L27 Games and Adversary Search (9.10)
Tue 03 Apr X02 SECOND MIDTERM (7-9 p.m., Thompson 102 and 104)
on Lectures 16-27
PART III: Regular Expressions, Finite-State Machines, and Computability
Wed 04 Apr L28 Regular Expressions and Their Languages (5.1, 5.2)
Fri 06 Apr --- NO DISCCUSSION (makeup for exam)
Fri 06 Apr L29 Proving Regular Language Identities (5.4)
Mon 09 Apr L30 Proving Properties of the Regular Languages (5.5)
Wed 11 Apr L31 What DFA's Can and Can't Do (14.1, 14.2)
Fri 13 Apr D09 Designing Regular Expressions (5.3)
Fri 13 Apr L32 The Myhill-Nerode Theorem (14.3)
Mon 16 Apr --- NO CLASS (Patriot's Day Holiday)
Tue 17 Apr L33 (MONDAY) NFA's and the Subset Construction (14.5, 14.6)
Wed 18 Apr L34 Killing λ-moves: λ-NFA's to NFA's (14.7)
Fri 20 Apr D10 Practicing Some Kleene Constructions (14.9, adapted)
Fri 20 Apr L35 Constructing NFA's from Regular Expressions (14.8)
Mon 23 Apr L36 State Elimination: NFA's to Regular Expressions (14.10)
Wed 25 Apr L37 Two-Way Automata and Turing Machines (15.1, 15.6)
Fri 27 Apr D11 More Kleene Practice (14.9, adapted)
Fri 27 Apr L38 Turing Machine Semantics (15.8)
Mon 30 Apr L39 The Halting Problem and Unsolvability (15.10)
Final Exam (cumulative) Tuesday 8 May, 1:00-3:00 p.m., Totman Gym
Last modified 21 March 2018