Discrete Mathematics

Class Information

  • Instructor: Edgar SIMO-SERRA
  • Dates: Oct, 2019〜Feb, 2020
  • Lectures: Thursday, 4th Period (14:45〜16:15)
  • Room: Room 56-104
  • E-mail: ess@waseda.jp

Overview

This course covers elementary discrete mathematics for computer science and engineering. An emphasis is given on mathematical definitions and proof with topics covering proof methods, induction, graph theory, counting and discrete probability. The course will be given in English.

The course will be evaluated fundamentally with a midterm examination on the 8th week and a final examination on the 15th week. In the case that the midterm evaluation goes poorly, it will not be used in the evaluation, which will then be based on fundamentally the final examination. Small in-class quizzes and attendance will also be considered in the final grade.

Schedule

  1. Introduction and Proofs MCS Chapters 1+2 DM Chapter 1
  2. Induction I MCS Chapter 5 DM Chapter 5
  3. Induction II MCS Chapter 7 DM Chapter 5
  4. Number Theory MCS Chapter 9 DM Chapter 4
  5. Graph Theory I MCS Chapter 10+11 DM Chapter 10
  6. Graph Theory II MCS Chapter 12 DM Chapter 10
  7. Graph Theory III MCS Chapter 13 DM Chapter 10
  8. Midterm Examination
  9. Sums MCS Chapter 14 DM Chapter 6
  10. Cardinality Rules MCS Chapter 15 DM Chapter 8
  11. Probability MCS Chapter 17+18 DM Chapter 7
  12. Random Variables MCS Chapter 19
  13. Expectation MCS Chapter 20
  14. Random Walks MCS Chapter 21
  15. Final Examination

Textbook

  • MCS Main Textbook Eric Lehman, F. Thomson Leighton, Albert R. Meyer, Mathematics for Computer Science, 2017. PDF
  • DM Kenneth Rosen, Discrete Mathematics and Its Applications, McGraw-Hill Education, 2018.