[an error occurred while processing this directive]
ICS-6A Winter 2002, Discrete Mathematics for Computer Science
[ course reference | schedule | homework | handouts | grades | exams ]

Schedule


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 Monday in most weeks 1 - 9. There will be a quiz in lecture on Wednesday in weeks 2, 3, 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. Counting, permutation and combinations ( 4.3, 4.6)
  • Week 4. Counting (4.6) Probability (4.4, handouts) (no quiz)
  • Week 5. Probability cont. (4.4,4.5, handouts)
  • Week 6. Probability (4.5, handouts), Methods of proof (3.1); Midterm, ; Wednesday February 13th, in class
  • Week 7. Mathematical induction (3.2)
  • Week 8. Sequence and summation (1.7); (Review of logarithms (A.1), self-reading); 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