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 Goessman 64. There are four discussion sections, each meeting on Mondays in either LGRC A203 (sections AA and AB) or LGRT 141 (sections AC and AD). Sections AA and AC meet 2:30-3:20, and sections AB and AD meet 3:35-4:25. 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 Wed 22 Jan L01 Sets and Strings (1.1, 1.2) Fri 24 Jan L02 Propositions and Boolean Operations (1.4) Mon 27 Jan L03 Set Operations and Truth Tables (1.5, 1.6) Mon 27 Jan D01 What is a Proof? (1.3) Wed 29 Jan L04 Rules for Propositional Proofs (1.7) Fri 31 Jan L05 Propositional Proof Strategies (1.8) Mon 03 Feb L06 Predicates and Relations (1.10, 2.1) (END OF ADD/DROP) Mon 03 Feb D02 A Murder Mystery (1.9) Wed 05 Feb --- NO CLASS (snow) Fri 07 Feb L07 Quantifiers and Languages (2.3, 2.5) Mon 10 Feb L08 Proofs With Quantifiers (2.6) Mon 10 Feb D03 Translating Quantifiers (2.4) Wed 12 Feb L09 Relations and Functions (2.8, 2.9) Fri 14 Feb L10/11 Partial Orders and Equivalence Relations (2.10, 2.11) Mon 17 Feb --- NO CLASS (President's Day Holiday) Tue 18 Feb L12 Divisibility and Primes (3.1) (MONDAY SCHEDULE) Tue 18 Feb D04 Practicing Proofs (2.7) (MONDAY SCHEDULE) Wed 19 Feb L13 Modular Arithmetic (3.3) Fri 21 Feb L14 The Chinese Remainder Theorem (3.5) Mon 24 Feb L15 The Fundamental Theorem of Arithmetic (3.6) Mon 24 Feb --- NO DISCUSSION (makeup for exam) Tue 25 Feb X01 FIRST MIDTERM (7-9 p.m., Hasbrouck A 20) on Lectures 1-15 PART II: Induction, Trees, and Searching Wed 26 Feb L16 Recursive Definition (4.1) Fri 28 Feb L17 Proof by Induction for Naturals (4.3) Mon 03 Mar L18 Variations on Induction for Naturals (4.4) Mon 03 Mar D05 Practicing Induction Wed 05 Mar L19 Proving the Basic Facts of Arithmetic (4.6) Thu 06 Mar --- Last Day to Drop With W or Elect Pass/Fail Fri 07 Mar L20 Strings and String Operations (4.7) Mon 10 Mar L21 Induction for Problem Solving (4.11) Mon 10 Mar D06 Some More Induction Practice (4.11) Wed 12 Mar L22 Graphs, Paths, and Trees (4.9, 9.1) Fri 14 Mar L23 Recursion on Trees (9.3) SPRING BREAK Mon 24 Mar L24 General, Breadth-First, and Depth-First Search (9.4, 9.5) Mon 24 Mar D07 Boolean Expressions (9.2) Wed 26 Mar L25 BFS and DFS on Graphs (9.6) Fri 28 Mar L26 Uniform-Cost and A* Search (9.8, 9.9) Mon 31 Mar L27 Games and Adversary Search (9.10) Mon 31 Mar --- NO DISCUSSION (makeup for second midterm) Mon 31 Mar X02 SECOND MIDTERM (7-9 p.m., in Hasbrouck A 20) on Lectures 16-27 PART III: Regular Expressions, Finite-State Machines, and Computability Wed 02 Apr L28 Regular Expressions and Their Languages (5.1, 5.2) Fri 04 Apr L29 Proving Regular Language Identities (5.4) Mon 07 Apr L30 Proving Properties of the Regular Languages (5.5) Mon 07 Apr D08 Designing Regular Expressions (5.3) Wed 09 Apr L31 What DFA's Can and Can't Do (14.1, 14.2) Fri 11 Apr L32 The Myhill-Nerode Theorem (14.3) Mon 14 Apr L33 NFA's and the Subset Construction (14.5, 14.6) Mon 14 Apr D09 Minimizing Finite Automata (14.3) Wed 16 Apr L34 Killing λ-moves: λ-NFA's to NFA's (14.7) Fri 18 Apr L35 Constructing NFA's from Regular Expressions (14.8) Mon 21 Apr --- NO CLASS (Patriots' Day Holiday) Wed 23 Apr L36 (MONDAY SCHEDULE) State Elimination: NFA's to Regular Expressions (14.10) Wed 23 Apr D10 (MONDAY SCHEDULE) Practicing Multiple Constructions (14.9) Fri 25 Apr L37 Two-Way Automata and Turing Machines (15.1, 15.6) Mon 28 Apr L38 Turing Machine Semantics (15.8) Mon 28 Apr D11 Course Evaluations Wed 30 Apr L39 The Halting Problem and Unsolvability (15.10) Final Exam (cumulative) Wed 7 May, 4:00-6:00 p.m., Marcus 131.Last modified 27 February 2014