📖 Syllabus

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

📚 Course Modules

The course spans two semesters with eight modules total:

Fall Semester:

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

Spring Semester:

• 🕸️ Module 5: Graph Theory – Weeks 1–4
• 🌊 Module 6: Flow Networks – Weeks 5–6
• 🤖 Module 7: Automata Theory – Weeks 7–12
• 🎲 Module 8: Combinatorics – Weeks 13–16

Click each module above to see detailed topics, learning outcomes, and applications.

🎯 Learning Objectives

By completing this course, students will develop:

• ✓ Mathematical reasoning – Construct and critique formal proofs
• ✓ Abstract thinking – Work with abstract mathematical structures
• ✓ Problem-solving – Apply techniques to discrete systems
• ✓ CS foundations – Build groundwork for algorithms, theory, and beyond

📋 Course Policies

Attendance

• Lectures: Mandatory – Material covered is essential for success
• Tests & Colloquiums: Attendance required on scheduled dates
• Defenses: Missing homework defense = zero score

Academic Integrity

⚠️ Plagiarism: Results in zero score, potential course failure, and academic misconduct report.

Communication

📚 Course Materials

Primary Resources

• Lecture Notes – Slides and PDFs for each module
• Homework Assignments – Practice problems with solutions
• Cheatsheets – Quick reference for key concepts

Recommended Textbooks

💡 Important Notes

⚠️ This course requires consistent effort throughout both semesters.

Discrete mathematics builds concepts cumulatively – missing lectures or falling behind makes catching up extremely difficult.

Key Points:

• Proof writing develops over time – expect initial difficulty
• Start homework early
• Use Telegram and mentors for questions