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
The Lectures were pretty clear and concept oriented. Yet there were some topics which aren't much clear, but still the whole course is pretty well arranged and good in explaining
I loved this course! So many interesting things to think about, thoughtfully explained by brilliant instructors. The puzzles really get you thinking. Such genius to put them before the lectures!
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!
The teachers are informative and good. They explain the topic in a way that we can easily understand. The slides provide all the information that is needed. The external tools are fun and informative.
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.