EduMentor
Get started
Home / Courses / MAT210
MAT210

Discrete Mathematics

Logic, sets, relations, graphs, trees, and combinatorics with directed application toward algorithmic thinking.

4.6(5)|2 mentees enrolled|20 sessions|B.Sc. CS, Year 2, Sem 3
Mentor: Nadia Aiman Zulkifli
Lecturer: Dr. Faiz Rashid

What you will learn

  • Read and write rigorous mathematical proofs
  • Apply induction to recursive structures
  • Reason about graphs, trees, and combinatorial objects
  • Translate problem statements into formal logic
  • Use discrete tools to analyse algorithm correctness
  • Bridge math intuition with code on weekly labs

Syllabus

  • Week 1Logic and propositions2 hours
  • Week 2Sets and functions2 hours
  • Week 3Relations and partial orders2 hours
  • Week 4Mathematical induction2 hours
  • Week 5Strong induction on trees2 hours
  • Week 6Combinatorics, counting2 hours
  • Week 7Graphs, fundamentals2 hours
  • Week 8Eulerian and Hamiltonian paths2 hours

Student mentor

NA

Nadia Aiman Zulkifli

B.Sc. CS student, CGPA 3.20+ , Faculty of Computer & Mathematical Sciences

4.6(5)

Patient and clear. Has already passed this course, runs peer sessions every Thursday under Dr. Faiz Rashid.