Welcome to CIT 5920: Discrete Mathematics for Computer Science for Fall 2025!
Our course website is now live and will be your primary resource throughout the semester. Here you’ll find:
Lecture notes and recordings posted after each class Module pages with readings, slides, and supplementary materials Homework assignments (both online and written components) Recitation materials to reinforce concepts through practice Office hours schedule for getting help when you need it Course announcements to keep you updated What to Expect This course will teach you the mathematical language and tools to formally express ideas that can be translated into code.
The topic of discrete math is covered in many textbooks, and so there are a lot of different options to choose from.
When looking for textbooks or resources for this course, it is important to consider the following:
Topic Match: The topics covered in this course (in order) are: Sets, relations, counting (also called combinatorics), discrete probability, logic, discrete proofs, and an introduction to simple graphs. The textbook should cover these topics in a way that is accessible to a computer science student.
