Computer ScienceBeginner Certificate

Discrete Mathematics

The mathematical foundations every CS student needs

No reviews yet — be the first! 0 students English
18 hours 36 lessons Beginner Updated July 2026

What you'll learn

Reason with propositional and predicate logic
Work with sets, relations, and functions
Understand and write mathematical proofs
Apply combinatorics to count and analyse algorithms
Use graph theory to model real-world problems
Understand modular arithmetic and its CS applications

About this course

A beginner-friendly introduction to the mathematical structures that underpin computer science. From propositional logic and set theory to graph theory and combinatorics, this course builds the rigorous thinking skills that are essential for algorithms, cryptography, and theoretical CS.

Course curriculum

36 lessons · 18 hours total

Your instructor

PR

Pallava Ray

Computer Science Educator

Pallava Ray is a mathematics and CS educator who makes discrete maths concrete and relevant. This course connects every topic directly to computer science applications so students always understand why it matters.

₹500