Schedule for CMPSCI 250, Fall 2004, Prof. D.A.M. Barrington

PART I:  Logic and Number Theory

Wed 08 Sep L01  Sets and Strings (1.1,1.2)
Fri 10 Sep L02  Propositions and Sets (1.4,1.5)
Mon 13 Sep L03  Propositional Proofs (1.6,1.7)
M/W 15 Sep D01  What is a Proof? (1.3)
Wed 15 Sep L04  Proofs and Predicates (1.8,1.10)
Fri 17 Sep L05  Relations and Quantifiers (2.1,2.3)
Mon 20 Sep L06  Proofs With Quantifiers (2.6)
M/W 22 Sep D02  Practicing Proofs (2.7)
Wed 22 Sep L07  Properties of Relations and Functions (2.8,2.9)
Fri 24 Sep L08  Partial Orders and Equivalence Relations (2.10,2.11)
Mon 27 Sep L09  Divisibility and Primes (3.1)
M/W 29 Sep D03  Playing With Numbers (3.2)
Wed 29 Sep L10  Modular Arithmetic (3.3)
Thu 30 Sep X01  EVENING EXAM on Lectures 1-10

PART II: Induction and Regular Expressions

Fri 01 Oct L11  The Chinese Remainder Theorem (3.5)
Mon 04 Oct L12  The Fundamental Theorem of Arithmetic (3.6)
M/W 06 Oct D04  There are Infinitely Many Primes (3.4)
Wed 06 Oct L13  Recursive Definition (4.1)
Fri 08 Oct L14  Proof By Induction for Naturals (4.3)
Mon 11 Oct ---  Holiday, Columbus Day
Wed 13 Oct L15  (Monday schedule, no discussion) Variations on Induction for Naturals (4.4)
Fri 15 Oct L16  Strings and String Operations (4.7)
Mon 18 Oct L17  Graphs and Paths (4.9)
M/W 20 Oct D05  Naturals and Strings (4.8)
Wed 20 Oct L18  Induction on Trees and Lisp Lists (4.10)
Fri 22 Oct L19  Induction for Problem Solving (4.11)
Mon 25 Oct L20  Regular Expressions and Languages (5.1,5.2)
M/W 27 Oct D06  Designing Regular Expressions (5.3)
Wed 27 Oct L21  Proofs for Regular Expressions (5.4,5.5)
Thu 28 Oct X02  EVENING EXAM on Lectures 11-21

PART III:  Combinatorics and Graph Theory

Fri 29 Oct L22  Counting: Sum, Product, and Inclusion/Exclusion Rules (6.1,6.2)
Mon 01 Nov L23  First and Second Counting Problems (6.3,6.4)
M/W 03 Nov D07  The Problem of Sorting (6.5)
Wed 03 Nov L24  The Third Counting Problem (6.6)
Fri 05 Nov L25  The Fourth Counting Problem (6.7)
Mon 08 Nov L26  Counting Balanced Parentheses (6.9,6.10)
M/W 10 Nov D08  Catalan Numbers (6.11)
Wed 10 Nov L27  Basic Probability (7.7)
Fri 12 Nov L28  Expected Value (7.8)
Mon 15 Nov L29  Graphs and Adjacency Matrices (8.1,8.2)
M/W 17 Nov D09  Analysis of Craps (7.9)
Wed 17 Nov L30  Counting Paths With Matrices (8.3)
Thu 18 Nov X03  EVENING EXAM on Lectures 22-30

PART IV: Finite-State Machines and Computability

Fri 19 Nov L31  What DFA's Can and Can't Do (9.1,9.2)
Mon 22 Nov ---  (Thursday schedule, no lecture or discussion)
Wed 24 Nov L32  (no discussion)  The Myhill-Nerode Theorem (9.3)
Fri 26 Nov ---  Holiday, Thanksgiving
Mon 29 Nov L33  NFA's and the Subset Construction (9.5,9.6)
M/W 01 Dec D10  Practicing Constructions (9.9, modified)
Wed 01 Dec L34  Killing Lambda-Moves:  Lambda-NFA's to NFA's (9.7)
Fri 03 Dec L35  Regular Expressions to Lambda-NFA's (9.9)
Mon 06 Dec L36  State Elimination: NFA's to Regular Expressions (9.10)
M/W 08 Dec D11  Course evaluations
Wed 08 Dec L37  Two-Way DFA's and Turing Machines (10.1,10.6)
Fri 10 Dec L38  Turing Machine Semantics and the Halting Problem (10.8,10.10)
Mon 13 Dec L39  (no discussion) Review and Coming Attractions

Final Exam during exam period as scheduled by the University

Last modified 7 September 2004