Analysis of Algorithms aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines, including probability theory, statistical physics, computational biology and information theory. This course covers recurrence relations, generating functions, asymptotics, and fundamental structures such as trees, permutations, strings, tries, words, and mappings, in the context of applications to the analysis of algorithms.

Math through calculus and basic familiarity with programming in a modern language such as Java. Knowledge of basic algorithms and data structures from Algorithms, Part I is helpful but not required. The video From Analysis of Algorithms to Analytic Combinatorics: A Journey with Philippe Flajolet, is an optional (since it contains some advanced material that is beyond the scope of this course) overview that gives some historical perspective and introduces this course and Analytic Combinatorics. 

This course is based on the textbook An Introduction to the Analysis of Algorithms by Sedgewick and Flajolet. You can find (free) web materials associated with the textbook at http://aofa.cs.princeton.edu/home.

There will be one lecture (about 80 minutes) and a problem set each week.