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
I lacked confidence in permutations and combinations since my high school, but now i am enjoying solving combinatorial problems. Thanks to professors
informative material presented clearly and simply. I had studied bayes before and it was nice to get a concise review.
I am grateful to the teachers for such an amazing journey throughout the courses. Especially the puzzles designed.
Great lessons, great instructors, literacy slides, this course has everything. I'm so proud to complete two out of five courses in this specialization!
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.