# Analysis of Algorithms

## Princeton University

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.

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.

### Syllabus

Lecture  1  Analysis of AlgorithmsLecture  2  RecurrencesLecture  3  Solving recurrences with GFsLecture  4  AsymptoticsLecture  5  The symbolic methodLecture  6  TreesLecture  7  PermutationsLecture  8  Strings and TriesLecture  9  Words and Mappings

### Recommended Background

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 obtain this book from the following:
AmazonBarnes and Noble, or InformIT.com
You can find (free) web materials associated with the textbook at http://aofa.cs.princeton.edu/home.

### Course Format

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

### FAQ

Does Princeton award credentials or reports regarding my work in this course?

No certificates, statements of accomplishment, or other credentials will be awarded in connection with this course.

• 2016年3月04日, 6 星期
• 2015年9月11日, 6 星期
• 2015年1月23日, 6 星期
• 2014年9月05日, 6 星期
• 2014年2月07日, 6 星期
• 2013年9月06日, 6 星期

• 免费:
• 收费:
• 证书:
• MOOC:
• 视频讲座:
• 音频讲座:
• Email-课程:
• 语言: 英语

### 反馈

Algorithms
Algorithms and data structures from the beginning to advanced analysis.
Алгоритмизация вычислений
1 курс МИЭМ ВШЭ, 4 кредита

Truss Analysis in 7 Easy Steps
Learn the method of joints and method of sections in 7 easy to follow steps...
This is a graduate course on the design and analysis of algorithms, covering...
Combinatorial Analysis
This course analyzes combinatorial problems and methods for their solution....
Introduction to Algorithms (SMA 5503)
This course teaches techniques for the design and analysis of efficient algorithms...
Integer Programming and Combinatorial Optimization
The course is a comprehensive introduction to the theory, algorithms and applications...

CS 282: Principles of Operating Systems II: Systems Programming for Android
Developing high quality distributed systems software is hard; developing high...
Ruby on Rails Tutorial: Learn From Scratch
This post is part of our “Getting Started” series of free text tutorials on...
NYU Course on Deep Learning (Spring 2014)
Lectures from the NYU Course on Deep Learning (Spring 2014) This is a graduate...
C++ Grandmaster Certification
The C++ Grandmaster Certification is an online course in which participants...
Computational Chemistry (CHEM 4021/8021)
Modern theoretical methods used in study of molecular structure, bonding, and...

First Year Teaching (Secondary Grades) - Success from the Start
Success with your students starts on Day 1. Learn from NTC's 25 years developing...
Understanding 9/11: Why Did al Qai’da Attack America?
This course will explore the forces that led to the 9/11 attacks and the policies...
Aboriginal Worldviews and Education
This course will explore indigenous ways of knowing and how this knowledge can...
Analytic Combinatorics
Analytic Combinatorics teaches a calculus that enables precise quantitative...
Accountable Talk®: Conversation that Works
Designed for teachers and learners in every setting - in school and out, in...