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
About this Course
Skills you will gain
- Mathematical Induction
- Proof Theory
- Discrete Mathematics
- Mathematical Logic
Syllabus - What you will learn from this course
Making Convincing Arguments
How to Find an Example?
Recursion and Induction
- 5 stars63.91%
- 4 stars24.02%
- 3 stars7.06%
- 2 stars2.02%
- 1 star2.96%
TOP REVIEWS FROM MATHEMATICAL THINKING IN COMPUTER SCIENCE
Course was good, but sometimes i needed additional sources to understand topic better. Maybe, it was because of my english. Anyway it gave me a path what i should look for! Thank you!
though i stuck somewhere but mentors was always there to assist you. really found this course interesting and very helpful. solved so much of tricky puzzles, Good 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.
This course has made me appreciate discrete mathematics than ever before. If you're even thinking about taking this course, then I RECOMMEND that you stop thinking and take it!
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.