Syllabus

The schedule below is tentative; the precise topics planned for each date may change as the term progresses. I also list those sections of the books that cover the relevant material.

Week 1: Logic, proofs, and algorithms
- June 20: Propositions (Rosen 1.1–1.2; L&L 4.1–4.8)
- June 21: Predicates and quantifiers (Rosen 1.3–1.4; L&L 4.11–4.12)
- June 22: Proofs (Rosen 1.5, 3.1; L&L 4.9–4.10)
- June 23: Algorithms (Rosen 2.1; L&L 3.8)
Week 2: Sets, functions, and relations
- June 27: Sets (Rosen 1.6–1.7; L&L 1.1–1.7, 1.9)
- June 28: Functions (Rosen 1.8; L&L 3.1–3.3)
- June 29: Relations (Rosen 7.1–7.3; L&L 2.1–2.4, 2.6, 2.10)
- June 30: Operations on relations (Rosen 2.7, 7.4; L&L 5.3, 5.11, 2.5, 2.7)
Week 3: Natural numbers, induction, and recursion
- July 4: HOLIDAY (no class, no office hours)
- July 5: Induction (Rosen 3.3; L&L 1.10, 11.1, 11.3)
- July 6: Recursion (Rosen 3.4–3.5; L&L 3.5–3.6)
- July 7: Arithmetic examples (Rosen 3.2; L&L 6.2)
Week 4: Divisibility, arithmetic algorithms, and counting
- July 11: Divisibility and primes (Rosen 2.4; L&L 11.2, 11.5, 11.7)
- July 12: Arithmetic algorithms (Rosen 2.5; L&L 11.4, 11.6)
- July 13: Finite cardinality (Rosen 4.1, 5.1; L&L 1.8, 3.7, 6.1, 7.1–7.3)
- July 14: Counting techniques (Rosen 4.2–4.5; L&L 6.3–6.6, 6.8)
Week 5: Equivalence relations, partial orders, and review
- July 18: Equivalence relations (Rosen 7.5; L&L 2.8)
- July 19: Partial orders (Rosen 7.6; L&L 2.9, 14.1–14.3, 14.6)
- July 20: Problem-solving
- July 21: Review
- July 22: Final exam, 10:30 to 12:30

Go back to the MATH/CS 11 homepage.

This web page was written between 2003 and 2005 by Toby Bartels. Toby reserves no legal rights to it.

The permanent URI of this web page is http://tobybartels.name/MATH11/2005/syllabus/.