Welcome to the Discrete Mathematics course, your gateway to mastering the mathematical foundations essential for modern computing and data science. Designed for aspiring software engineers, computer scientists, data analysts, and cryptographers, this course is ideal for undergraduate students, professionals looking to enhance their analytical skills, and anyone interested in the theoretical underpinnings of computer science.
Discrete Mathematics for Computer Science and Engineering
This Labor Day, enjoy $120 off Coursera Plus. Unlock access to 10,000+ programs. Save today.
Discrete Mathematics for Computer Science and Engineering
Instructor: BITS Pilani Instructors Group
Included with 
Gain insight into a topic and learn the fundamentals.
Beginner level
Recommended experience
4 weeks to complete
at 10 hours a week
Flexible schedule
Learn at your own pace
What you'll learn
Analyse and assess complex problems by applying set theory and functions, ensuring accurate and efficient solutions are developed.
Design and evaluate graph-based models to optimise algorithms and enhance network analysis in cryptography and database management contexts.
Critique mathematical proofs and reasoning to enhance problem-solving skills in varied scenarios.
Innovate discrete structures to efficiently solve problems in data structures, operating systems, and computation theory.
Skills you'll gain
Details to know
Shareable certificate
Add to your LinkedIn profile
Recently updated!
August 2025
Assessments
129 assignments
Taught in English
See how employees at top companies are mastering in-demand skills
There are 10 modules in this course
In this module, you will first learn the basics of formal logic. With that foundational knowledge, you will learn multiple techniques to write mathematical proof in order to prove a statement. You will gain insights into how to choose proof methods, including direct proofs, indirect proofs, trivial proofs, and vacuous proofs.
What's included
13 videos9 readings11 assignments1 plugin
In this module, you will learn about more proof techniques, including proof by contradiction, existence proofs, and proof by cases. You will recognise some common fallacies in incorrect proofs. Following this, you will learn about mathematical induction and strong mathematical induction. You will gain insights into writing inductive proof for standard theorems and problems. You will learn about sequences and summations. You will also learn about arithmetic, geometric, and harmonic progressions and their corresponding series.
What's included
14 videos13 readings13 assignments
This module introduces you to sets and functions. You will get acquainted with Venn diagrams, the cardinality of a set, power sets, set operations, set identities, and computer representation of sets. You will learn about injective, surjective, and bijective functions.
What's included
17 videos15 readings15 assignments
This module introduces you to relations by illustrating n-ary relations, complementary relations, and relations on a set. You will learn about reflexive, symmetric, anti-symmetric, and transitive relations. You will also learn about functionality, composite relations, representing relations, closure of relations, and applications of relations in computer science. You will also learn about the countability and uncountability of sets.
What's included
15 videos15 readings15 assignments
In this module, you will learn about equivalence relations, equivalence classes, and partitions. You will gain insights into partial ordering, partial or total ordered sets, and the Hasse diagram. You will also learn about maximal and minimal elements, least upper bound (lub ) and greatest lower bounds (glb ), and lattice.
What's included
15 videos14 readings15 assignments
In this module, you will learn about counting techniques, including the pigeonhole principle, permutations and combinations, and the inclusion-exclusion principle. You will gain insights into combinatorics, a subfield of discrete mathematics that deals with arrangements of discrete objects with specific constraints and the number of distinct ways of making such arrangements.
What's included
15 videos15 readings15 assignments
In this module, you will learn about definitions of recursive functions. You will learn to use structural induction to prove statements that use recursive definitions. You will also learn about recurrence relations and explore some techniques to solve them.
What's included
15 videos14 readings14 assignments
This module introduces you to graphs, starting from real-world examples. Following this, you will learn about rigorous definitions of graphs and techniques to represent them. You will also gain insights into bipartite graphs and graph isomorphism.
What's included
12 videos12 readings12 assignments
In this module, you will learn about more advanced topics pertaining to graphs. You will learn about definitions of paths and connectivity. You will also learn about Euler and Hamilton paths, planar graphs, and graph colorings and their applications.
What's included
8 videos7 readings7 assignments
This module introduces you to the fundamentals of trees and spanning trees of a graph. You will learn about algorithms to identify minimum spanning trees in a graph. Following this, the module introduces you to the notions of basic algebraic structures such as groups, semi-groups, and rings.
What's included
12 videos12 readings12 assignments
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor
Birla Institute of Technology & Science, Pilani
10 Courses32,180 learners
Explore more from Algorithms
Status: PreviewShanghai Jiao Tong University
Status: Free TrialUniversity of California San Diego
Status: Free TrialUniversity of London
Status: Free TrialUniversity of Colorado System
Why people choose Coursera for their career
Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."
Open new doors with Coursera Plus
Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription
Advance your career with an online degree
Earn a degree from world-class universities - 100% online
Join over 3,400 global companies that choose Coursera for Business
Upskill your employees to excel in the digital economy
Frequently asked questions
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.
More questions
Financial aid available,