The text of the discussion assignments is normally taken from the matching section of the textbook and is generally not given here. Solutions to the discussion problems will be posted sometime after both sections have met:

- Discussion #1: What is a Proof? (1.3) (6 and 8 February 2006)
- Discussion #2: Translating Quantifiers (2.4) (13 and 15 February 2006)
- Discussion #3: Practicing Proofs (2.7) (20 and 22 February 2006)
- Discussion #4: Infinitely Many Primes (3.4) (27 February and 1 March 2006)
- Discussion #5: Recursive Algorithms (4.2) (6 and 8 March 2006)
- Discussion #6: Naturals and Strings (4.8) (27 and 29 March 2006)
- Discussion #7: Designing Regular Expressions (5.3) (3 and 5 April 2006)
- Discussion #8: The Problem of Sorting (6.5) (10 and 12 April 2006)
- Discussion #9: Paths and Matrices (not in book) (24 and 26 April 2006)
- Discussion #10: Minimizing Two DFA's (9.3) (1 and 3 May 2006)
- Discussion #11: Practicing Multiple Constructions (9.9) (8 and 10 May 2006)
- Discussion #12: Course Evaluations (15 and 17 May 2006)

Last modified 15 May 2006