The following list of topics and corresponding readings is subject
to change. All readings refer to the textbook: K. H. Rosen,
Discrete Mathematics and its Applications , Fourth Edition, McGraw-Hill, 1995.
Homework assignments will be available starting each Tuesday in weeks 1--9.
There will be a quiz in lecture on Thursday in weeks 2, 3, 4, 5, 7, 8, 9, 10.
- Week 1. Introduction to the course: Logic (1.1 -1.3); Sets (1.4)
- Week 2. Set operations (1.5) Counting basics (4.1, 4.2)
- Week 3. Permutation and combinations (4.3, 4.6)
- Week 4. Probability (4.4, 4.5, handouts)
- Week 5. Probability cont. (4.4,4.5, handouts)
- Week 6. Methods of proof (3.1); Midterm, ; Thursday, November 2nd, in class
- Week 7. Mathematical induction (3.2)
- Week 8. Sequence and summation (1.7); Review of logarithms (A.1);
Recursive definitions (3.3)
- Week 9. Setting up recurrence relations ( 5.1)
- Week 10. Solving recurrence relations (5.1,5.2 through page 323)
- Week 11. Final Exam Tuesday, December 5
|
