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 Wednesdays. Section AA meets at 11:15 in LGRC 301, Section AB at 12:20 Ag. Engin. 119, Section AC at 11:15 in LGRT 121, and Section AD at 12:20 in ELAB 306. 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 09 Sep --- NO DISCUSSION before first lecture
Wed 09 Sep L01 Sets and Strings (1.1, 1.2)
Fri 11 Sep L02 Propositions and Boolean Operations (1.4)
Mon 14 Sep L03 Set Operations and Truth Tables (1.5, 1.6)
Wed 16 Sep D01 What is a Proof? (1.3)
Wed 16 Sep L04 Rules for Propositional Proofs (1.7)
Fri 18 Sep L05 Propositional Proof Strategies (1.8)
Mon 21 Sep L06 Predicates and Relations (1.10, 2.1) (END OF ADD/DROP)
Wed 23 Sep D02 A Murder Mystery (1.9)
Wed 23 Sep L07 Quantifiers and Languages (2.3, 2.5)
Fri 25 Sep L08 Proofs With Quantifiers (2.6)
Mon 28 Sep L09 Relations and Functions (2.8, 2.9) (DAVE AWAY)
Wed 30 Sep --- NO DISCUSSION (DAVE AWAY)
Wed 30 Sep L10 Equivalence Relations (2.10) (DAVE AWAY)
Fri 02 Oct L11 Partial Orders (2.11) (DAVE AWAY)
Mon 05 Oct L12 Divisibility and Primes (3.1)
Wed 07 Oct D03 Practicing Proofs (2.7)
Wed 07 Oct L13 Modular Arithmetic (3.3)
Fri 09 Oct L14 The Chinese Remainder Theorem (3.5)
Mon 12 Oct --- NO CLASS (Columbus Day Holiday)
Tue 13 Oct L15 The Fundamental Theorem of Arithmetic (3.6)
Wed 14 Oct D04 Infinitely Many Primes (3.4)
Wed 14 Oct X01 FIRST MIDTERM (7-9 p.m., Marcus 131) on Lectures 1-15
PART II: Induction, Trees, and Searching
Wed 14 Oct L16 Recursive Definition (4.1)
Fri 16 Oct L17 Proof by Induction for Naturals (4.3)
Mon 19 Oct L18 Variations on Induction for Naturals (4.4)
Wed 21 Oct D05 Practicing Induction Proofs (not in book)
Wed 21 Oct L19 Proving the Basic Facts of Arithmetic (4.6)
Thu 22 Oct --- Last Day to Drop With W or Elect Pass/Fail
Fri 23 Oct L20 Strings and String Operations (4.7)
Mon 26 Oct L21 Induction for Problem Solving (4.11)
Wed 28 Oct D06 More Induction Practice (not in book)
Wed 28 Oct L22 Graphs, Paths, and Trees (4.9, 9.1)
Fri 30 Oct L23 Recursion on Trees (9.3)
Mon 02 Nov L24 General, Breadth-First, and Depth-First Search (9.4, 9.5)
Wed 04 Nov D07 Boolean Expressions (9.2)
Wed 04 Nov L25 BFS and DFS on Graphs (9.6)
Fri 06 Nov L26 Uniform-Cost and A* Search (9.8, 9.9)
Mon 09 Nov L27 Games and Adversary Search (9.10)
Wed 11 Nov --- NO CLASS OR DISCUSSION (Veterans' Day Holiday)
Thu 12 Nov X02 SECOND MIDTERM (7-9 p.m., Thompson 102 and 106)
on Lectures 16-27
PART III: Regular Expressions, Finite-State Machines, and Computability
Fri 13 Nov L28 Regular Expressions and Their Languages (5.1, 5.2)
Mon 16 Nov L29 Proving Regular Language Identities (5.4)
Wed 18 Nov D08 Designing Regular Expressions (5.3)
Wed 18 Nov L30 Proving Properties of the Regular Languages (5.5)
Fri 20 Nov L31 What DFA's Can and Can't Do (14.1, 14.2)
Mon 23 Nov L32 The Myhill-Nerode Theorem (14.3)
Wed 25 Nov D09 Syntactic Monoids (14.4)
Wed 25 Nov L33 NFA's and the Subset Construction (14.5, 14.6)
Fri 27 Nov --- NO CLASS (Thanksgiving Holiday)
Mon 30 Nov L34 Killing λ-moves: λ-NFA's to NFA's (14.7)
Wed 02 Dec D10 Practicing Some Kleene Constructions (14.9, adapted)
Wed 02 Dec L35 Constructing NFA's from Regular Expressions (14.8)
Fri 04 Dec L36 State Elimination: NFA's to Regular Expressions (14.10)
Mon 07 Dec L37 Two-Way Automata and Turing Machines (15.1, 15.6)
Wed 09 Dec D11 Course Evaluations
Wed 09 Dec L38 Turing Machine Semantics (15.8)
Fri 11 Dec L39 The Halting Problem and Unsolvability (15.10)
Final Exam (cumulative) Fri 18 Dec, 1:00-3:00 pm, Goessman 64
Last modified 22 October 2015