This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
- 5 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
clear explanation, and amazing tools to analyze algorithms through a scientific approach.
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
This is great course if you already done some algorithms courses and want to go deeper.
Can I earn a certificate in this course?
No. As per Princeton University policy, no certificates, credentials, or reports are awarded in connection with this course.