Counting is one of the basic mathematically related tasks we encounter on a day to day basis. The main question here is the following. If we need to count something, can we do anything better than just counting all objects one by one? Do we need to create a list of all phone numbers to ensure that there are enough phone numbers for everyone? Is there a way to tell that our algorithm will run in a reasonable time before implementing and actually running it? All these questions are addressed by a mathematical field called Combinatorics.
This course is part of the Introduction to Discrete Mathematics for Computer Science Specialization
About this Course
Skills you will gain
- Random Variable
- Probability Interpretations
Syllabus - What you will learn from this course
- 5 stars70.66%
- 4 stars20.29%
- 3 stars6.93%
- 2 stars1.11%
- 1 star0.99%
TOP REVIEWS FROM COMBINATORICS AND PROBABILITY
The final project is hard for me cuz I don't have Python experience. and the logic is a little bit complicated. That's not for absolutely beginners!
Had loads of fun during most part of the course. Frequent quizzes keep the learner on toes. Thoroughly enjoyed the final programming quiz to implement a dice game.
Special thanks to Prof. Vladimir Podolskii and Prof. Alexander S. Kulikov for their amazing explanations and diligent visuals of the concepts as well as problem sets. You Rock!
This course provided me with new ways to confront the problems of combinatorics. I am very grateful to the faculty for their content and coursera for giving me financial aid.
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.