Reading assignments are from Barrington: A Mathematical Foundation for Computer Science (draft), available in two parts. The book is an e-book available for $60 from Kendall Hunt Publishing.
Lectures are MWF. Section 01 (Dave) has lectures 12:20-1:10 PM in Goessmann 64. Section 02 (Kyle) has lectures 10:10-11:00 PM, also in Goessmann 64. There are eight discussion sections (four serving each lecture), each meeting on Fridays. Section 01AA meets at 10:10 in Marston 220, Section 01AB meets at 1:25 in Holdsworth 203, Section 01AC meets at 11:15 in Marston 220, Section 01AD meets at 11:15 in Tobin 204, Section 02AA meets at 9:05 in ELAB 323, Section 02AB meets at 1:25 in Flint 201, Section 02AC meets at 12:20 in ELAB 304, and Section 02AD meets at 11:15 in Flint 105.
There are two evening exams to be scheduled on 3 March and 7 April, and two discussion sections are cancelled to compensate for the extra time.
The six homework assignments are due at dates that will be given below.
The weekly quizzes will be each Tuesday, due at 8:00 p.m., except for 25 January, 1 February, 8 March, and 12 April.
PART I: Logic and Number Theory Wed 26 Jan L01 Sets and Strings (1.1, 1.2) Fri 28 Jan D01 What is a Proof? (1.3) Fri 28 Jan L02 Propositions and Boolean Operations (1.4) Mon 31 Jan L03 Set Operations and Truth Tables (1.5, 1.6) Wed 02 Feb L04 Rules for Propositional Proofs (1.7) (END OF ADD) Fri 04 Feb D04 NO DISCUSSION (weather) Fri 04 Feb L05 NO LECTURE (weather) Mon 07 Feb L05 Propositional Proof Strategies (1.8) (END OF DROP) Wed 09 Feb L06 Predicates and Relations (1.10, 2.1) Fri 11 Feb D02 A Murder Mystery (1.9) Fri 11 Feb L07 Quantifiers and Languages (2.3, 2.5) Mon 14 Feb L08 Proofs With Quantifiers (2.6) Mon 14 Feb H01 Homework #1 due at 11:59 p.m. Wed 16 Feb L9/10 Relations and Functions, Equivalence Relations (2.9, 2.10) Fri 18 Feb D04 Practicing Proofs (2.7) Fri 18 Feb L10/1 Equivalence Relations, Partial Orders (2.10, 2.11) Mon 21 Feb --- HOLIDAY (Presidents' Day) Tue 22 Feb L12 Divisibility and Primes (3.1) (MONDAY) Wed 23 Feb L13 Modular Arithmetic (3.3) Fri 25 Feb --- NO DISCUSSION (weather) Fri 25 Feb L14 The Chinese Remainder Theorem (3.5) (ON ZOOM, WEATHER) Fri 25 Feb H02 Homework #2 due at 11:59 p.m. Mon 28 Feb L15 The Fundamental Theorem of Arithmetic (3.6) Thu 03 Mar X01 FIRST MIDTERM (7-9 p.m., room TBA) on Lectures 1-15 PART II: Induction, Trees, and Searching Wed 02 Mar L16 Recursive Definition (4.1) Fri 04 Mar D05 Infinitely Many Primes (3.4) Fri 04 Mar L17 Proof by Induction for Naturals (4.3) Mon 07 Mar L18 Variations on Induction for Naturals (4.4) Wed 09 Mar L19 Proving the Basic Facts of Arithmetic (4.6) Fri 11 Mar D06 Practicing Induction Proofs (not in book) Fri 11 Mar L20 Recursive Definition for Strings (4.7) Fri 11 Mar H03 Homework #3 due at 11:59 p.m. SPRING BREAK Mon 21 Mar L21 Induction for Problem Solving (4.11) Wed 23 Mar L22 Graphs, Paths, and Trees (4.9, 9.1) Fri 25 Mar D07 More Induction Practice (not in book) Fri 25 Mar L23 Recursion on Trees (9.3) Mon 28 Mar L24 General, Breadth-First, and Depth-First Search (9.4, 9.5) Tue 29 Mar --- Last Day to Drop With W or Elect Pass/Fail Wed 30 Mar L25 BFS and DFS on Graphs (9.6) Fri 01 Apr D08 Boolean Expression Trees (9.2) Fri 01 Apr L26 Uniform-Cost and A* Search (9.8, 9.9) Fri 01 Apr H04 Homework #4 due at 11:59 p.m. Mon 04 Apr L27 Games and Adversary Search (9.10) Thu 07 Apr X02 SECOND MIDTERM (7-9 p.m., room TBA) on Lectures 16-27 PART III: Regular Expressions, Finite-State Machines, and Computability Wed 06 Apr L28 Regular Expressions and Their Languages (5.1, 5.2) Fri 08 Apr --- NO DISCUSSION (makeup for exam) Fri 08 Apr L29 Proving Regular Language Identities (5.4) Mon 11 Apr L30 Proving Properties of the Regular Languages (5.5) Wed 13 Apr L31 What DFA's Can and Can't Do (14.1, 14.2) Fri 15 Apr D09 Designing Regular Expressions (5.3) Fri 15 Apr L32 The Myhill-Nerode Theorem (14.3) Fri 15 Apr H05 Homework #5 due at 11:59 p.m. Mon 18 Apr --- HOLIDAY (Patriots' Day) Wed 20 Apr L33 NFA's and the Subset Construction (14.5, 14.6) Fri 22 Apr D10 State Minimization (14.3, adapted) Fri 22 Apr L34 Killing λ-moves: λ-NFA's to NFA's (14.7) Mon 25 Apr L35 Constructing NFA's from Regular Expressions (14.8) Wed 27 Apr L36 State Elimination: NFA's to Regular Expressions (14.10) Fri 29 Apr D11 Practicing Some Kleene Constructions (14.9, adapted) Fri 29 Apr L37 Two-Way Automata and Turing Machines (15.1, 15.6) Mon 02 May L38 Turing Machine Semantics (15.8) Wed 04 May L39 The Halting Problem and Unsolvability (15.10) Wed 04 May H06 Homework #6 due at 11:59 p.m. Final Exam (cumulative), during exam period, date to be decided, room TBA
Last modified 3 March 2022