Mathematical thinking is crucial in all areas of computer science: algorithms, bioinformatics, computer graphics, data science, machine learning, etc. In this course, we will learn the most important tools used in discrete mathematics: induction, recursion, logic, invariants, examples, optimality. We will use these tools to answer typical programming questions like: How can we be certain a solution exists? Am I sure my program computes the optimal answer? Do each of these objects meet the given requirements?
This course is part of the Introduction to Discrete Mathematics for Computer Science Specialization
Offered By
About this Course
Skills you will gain
- Mathematical Induction
- Proof Theory
- Discrete Mathematics
- Mathematical Logic
Offered by
Syllabus - What you will learn from this course
Making Convincing Arguments
How to Find an Example?
Recursion and Induction
Logic
Reviews
- 5 stars63.91%
- 4 stars24.05%
- 3 stars7.07%
- 2 stars1.98%
- 1 star2.97%
TOP REVIEWS FROM MATHEMATICAL THINKING IN COMPUTER SCIENCE
I have come to know how mathematical proof is fun thing to do, this course transformed me, i highly recommend it to every one. I would like to thank every one involved in providing this course.
I really liked this course, it's a good introduction to mathematical thinking, with plenty of examples and exercises, I also liked the use of other external graphical tools as exercises.
a lot of it was hard to understand but it was nice to learn through the puzzles. i was completely lost during the honors content, and i thought we weren't well-prepared for the programming assignments
I applaud the instructors for their efforts in explaining the concepts as they could be abstract and hard to explain in words! More examples to illustrate the concepts will be even more helpful!
About the Introduction to Discrete Mathematics for Computer Science Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.