Discrete Mathematics


  • 講師: シモセラ エドガー
  • 日程: 2019年10月〜2020年01月
  • 曜日時限: 木曜日 4時限(14:45〜16:15)
  • 教室: Room 56-104
  • メール: ess@waseda.jp


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.


  1. Introduction and Proofs 資料 MCS Chapters 1+2 DM Chapter 1
  2. No Class
  3. Induction I 資料 MCS Chapter 2+5 DM Chapter 5
  4. Induction II 資料 MCS Chapter 5 DM Chapter 5
  5. Number Theory I 資料 MCS Chapter 9 DM Chapter 4
  6. Number Theory II 資料 MCS Chapter 9 DM Chapter 4
  7. Graph Theory I 資料 MCS Chapter 10+11 DM Chapter 10
  8. Midterm Examination
  9. Graph Theory II 資料 MCS Chapter 12+13 DM Chapter 10
  10. No Class
  11. Probability 資料 MCS Chapter 17 DM Chapter 7
  12. Conditional Probability 資料 MCS Chapter 18
  13. Expectation I 資料 MCS Chapter 19
  14. Expectation II 資料 MCS Chapter 20
  15. Final Examination


  • 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.