About this Course

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. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Analysis of Algorithms, Second Edition (upon which the course is based) or to visit the website aofa.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.

Created by: Princeton University