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.97%
- 4 stars24.06%
- 3 stars7.07%
- 2 stars1.94%
- 1 star2.94%
TOP REVIEWS FROM MATHEMATICAL THINKING IN COMPUTER SCIENCE
Contents are very good for starting.....
But the Teachers way of explaining is not up to the mark. I need to search in youTube or google for understanding any topic even watching the videos.
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 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.
The excellent approaching of supplanting intuition with puzzles to help reason, before starting the lectures makes proof making one of the most fun parts in this course.
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.