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.93%
- 4 stars24.04%
- 3 stars7.07%
- 2 stars1.98%
- 1 star2.97%
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.
I personally have very limited coding skills. this course was able to build my funadmentals in both math and science while understanding more of the bridge between the two. Very thankful for it.
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
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.