Discrete mathematics is the study of mathematical structures that are fundamentally discrete such as predicates, integers, relations, graphs, etc. The development of digital computers has motivated the development of discrete mathematics and the concepts and notations from discrete mathematics are useful in studying and describing objects and problems in branches of computer science, such as computer algorithms, programming languages, compiler design, cryptography, automated theorem proving, and software development.

Announcements / Assessments

June 2025 Semester:

  • Tutorial starts from Week 1 (so that we can complete the course by Week 13)

  • Week 1 Friday : Awal Muharram public holiday

  • Week 6 Friday (tentative) : Test 1 (One hour, 20 Marks)

  • Week 11 Friday : Prophet Muhammads’s Birthday public holiday

  • Week 12 Wednesday (tentative) : Test 2 (One hour, 20 Marks)

Lecture Notes

Older Lecture Slides from 2021:

Tutorials

  1. Tutorial 1: Propositional Logic (Semantics and Inference

  2. Tutorial 2: Valid and Invalid Arguments

  3. Tutorial 3: Elementary Number Theory and Methods of Proof

  4. Tutorial 4: Relations

References

  1. https://en.wikipedia.org/wiki/Discrete_mathematics

  2. Epp, S. S., 2020. Discrete Mathematics with Applications. 5th ed. Boston, MA: Brooks/Cole Cengage Learning.

  3. Rosen, K. H., 2019. Discrete Mathematics and its Applications. 8th ed. New York: McGraw-Hill.

  4. Scheinerman, E. R., 2013. Mathematics --- A Discrete Introduction. 3rd ed. Boston, Mass.: Brooks/Cole.