Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.


Discrete Mathematics

Indian Institute of Technology, Ropar and NPTEL via Swayam


The course will be an introduction to Discrete Mathematics which comprises of the essentials for a computer science student to go ahead and study any other topics in  the subject. The emphasis will be on problem solving as well as proofs. We will be providing motivational illustrations and applications through out the course. The course doesnt assume any pre-requisites except for high school level arithmetic and algebra.


Week 1  : Counting
Week 2  : Set Theory
Week 3  : Logic
Week 4  : Relations
Week 5  : Functions
Week 6  : Mathematical Induction
Week 7  : Pigeonhole Principle
Week 8  : Graph Theory - 01 Week 9  :  Graph Theory - 02
Week 10  : Generating Functions
Week 11  : Principle of Inclusion-Exclusion
Week 12  :  Recurrence Relations

Taught by

Prof. Sudarshan Iyengar

Related Courses


5.0 rating, based on 1 reviews

Start your review of Discrete Mathematics

  • Sunil Kanupuru is taking this course right now and found the course difficulty to be medium.

    This is an excellent course to learn the fundamental blocks of computing. Looks like instructors have done lot of work in making such interesting and very well explained videos. Also this does not limit to theory and will give the glimpses of applications and also tools to solve such problems through Networkx package in Python language. Overall this is very helpful course togo through some advanced courses like Algorithms and Algorithm design.

Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free