Syllabus

This course covers fundamental discrete mathematics concepts essential for computer science.

Course Modules

The course is organized into four main modules. Click each to see detailed topics:

• Module 1: Set Theory - Weeks 1-2, 6
• Module 2: Binary Relations - Weeks 3-7
• Module 3: Boolean Algebra - Weeks 8-10
• Module 4: Formal Logic - Weeks 11-16

Learning Objectives

Students will develop:

• Mathematical reasoning and proof-writing skills
• Ability to work with abstract mathematical structures
• Problem-solving techniques for discrete systems
• Foundations for advanced computer science topics

Course Policies

Attendance

• Lectures are mandatory
• Material covered in lectures is essential for success

Academic Integrity

• Homework: Discussion encouraged, but write solutions independently
• Tests & Exams: Individual work only
• Plagiarism: Results in zero score and course failure

Communication

• Telegram: Main channel for announcements
• GitHub: Course materials and issue tracker
• Office Hours: To be announced
• Email: Private matters only

Materials

Primary:

• Course lecture notes (PDF)
• Homework assignments
• Practice problems

Supplementary:

• Kenneth Rosen, Discrete Mathematics and Its Applications
• Susanna Epp, Discrete Mathematics with Applications
• Richard Hammack, Book of Proof (free online)

Important Notes

This course requires consistent effort throughout the semester. Discrete mathematics builds concepts cumulatively—missing lectures or falling behind makes catching up difficult.

Mathematical proof writing is a skill that develops over time. Expect initial difficulty, but persistence leads to mastery.

Success requires active engagement with the material, not just memorization of formulas.