MA210 (Discrete Mathematics)

Course content (Official)

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph Theory: basic concepts; walks, paths, tours and cycles; trees and forests; colourings. Coding theory: basic concepts; linear codes.

Material (Official and mine)

Here are some notes I took during the course and that helped me teach it.

Week	Notes
Week 1	Notes
Week 2	Notes
Week 3	Notes
Week 4	Notes
Week 5	Notes
Week 6	Notes
Week 7	Notes
Week 8	Notes
Week 9	Notes