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 most weeks 1 - 9. There will be a quiz in lecture on Thursday in weeks 2, 3, 5, 7, 8, 9, 10.

• Week 1. Introduction to the course: Logic (1.1 -1.4, sets 1.6)
• Week 2. Sets and Set operations (1.7) Counting basics (4.1,4.2)
• Week 3. Permutation and combinations ( 4.3-- 4.5)
• Week 4. Probability (5.1, 5.2)
• Week 5. Probability cont. (5.2,5.3)
• Week 6. Methods of proofs (1.5, 3.1) ; Midterm, Thursday February 19 ;
• Week 7. Mathematical induction, sequence and summation (3.3, 3.2), Review of Logarithms (A.1), self-reading
• Week 8. Recursive definitions and algorithms (3.4,3.5), recurrence relations (6.1)
• Week 9. Recurrence relations, continued (6.1), solving resurrence relations (6.2)
• Week 10. Solving recurrence relations cont. (6.2, part of 6.3 )
• Week 11. Final Exam