Syllabus
The precise topics planned for each date may change as the term progresses.
In particular, recurrence equations have been moved to Week 5.
The schedule lists those sections of the books
that covers the relevant material;
there have also been handouts on
propositions, sets, and valid arguments.
- Week 1: Logic and sets
- July 28: Propositions (Schaum's 4.1-4.8; Rosen 1.1-1.2)
- July 29: Predicates and quantifiers
(Schaum's 4.11-4.12; Rosen 1.3-1.4)
- July 30: Sets (Schaum's 1.1-1.9; Rosen 1.6-1.7)
- July 31: Functions (Schaum's 3.1-3.3; Rosen 1.8)
- Week 2: Proofs
- August 4: Valid arguments (Schaum's 4.9-4.10; Rosen 1.5, 3.1)
- August 5: Recursion (Schaum's 2.2, 3.5-3.6; Rosen 3.2, 3.4)
- August 6: Induction (Schaum's 1.10; Rosen 3.3)
- August 7: Examples
- Week 3: Counting
- August 11: Basic techniques (Schaum's 6.1-6.2, 6.7; Rosen 4.1)
- August 12: The pigeon-hole principle (Schaum's 6.6; Rosen 4.2)
- August 13: Recurrence equations (Schaum's A.1-A.4; Rosen 6.1-6.2)
- August 14: Permutations and combinations
(Schaum's 6.3-6.5, 6.8; Rosen 4.3-4.5)
- Week 4: Relations
- August 18: Types of relations
(Schaum's 2.1, 2.3-2.4, 2.6, 2.10; Rosen 7.1-7.3)
- August 19: Operations on relations (Schaum's 2.5, 2.7; Rosen 7.4)
- August 20: Equivalence relations (Schaum's 2.8; Rosen 7.5)
- August 21: Partial orders
(Schaum's 2.9, 14.1-14.3, 14.6; Rosen 7.6)
- Week 5: Graphs and review
- August 25: Graphs (Schaum's 8.2-8.5, 9.2; Rosen 8.1-8.5)
- August 26: Trees (Schaum's 8.8, 9.4, 10.1-10.2; Rosen 9.1-9.2)
- August 27: Problem-solving
- August 28: Review
- August 29: Final exam, 7:30 to 9:30
Go back to the MATH 112 homepage.
This web page was written in 2003 by Toby Bartels.
Toby reserves no legal rights to it.
The permanent URI of this web page
is
http://tobybartels.name/MATH112/2003/syllabus/.
