Online Course Materials
This page provides access to online lectures, lecture slides, and
assignments for use in teaching and learning from the book
An Introduction to the Analysis of Algorithms. It is
appropriate for use by instructors as the basis for a "flipped" class
on the subject, or for selfstudy by individuals.
Flipped Class.
If you are an an instructor teaching the analysis of algorithms, an effective way for you to teach the material in a typical college class is to adhere to a weekly cadence, as follows: Each week, send an email note to all students in the class that briefly describes assignments for that week (lectures, reading, and problem sets). The emails used in the Spring 2017 offering at Princeton are accessible in the table below; please feel free to edit them and use them in your own class.
 Students watch the lectures at their own pace, do the reading and work on the problem sets (each lecture ends with a few suggestions for assignments, which instructors typically tailor to their own needs.
 A weekly "class meeting" is scheduled for discussion of the material, reviews for exams, informal interaction with students, and any enrichment material you may wish to cover.
Selfstudy
An effective way to learn the material on your own is to play the lectures on some regular schedule, do the associated reading, and attempt to solve some of the assigned exercises on your own. If you get stuck on a particular exercise, find some others in the book or on this website, or try to solve some of the problems given in the lectures without looking at the solutions there. In the future, we plan to add more exercises with solutions to this website, but that is work in progress.While some of the reading material may be difficult for a typical undergraduate to master on such a quick pass through, a substantial fraction of the coverage is elementary, and the lectures provide a firm basis for understanding the key concepts. At Princeton, we use these materials to teach the first half of a seniorlevel undergraduate course (the second half of the course covers Analytic Combinatorics).
WEEKLY ASSIGNMENT  LECTURE VIDEOS  LECTURE SLIDES  QUESTIONS 

AofAweek1.txt 
0. Introduction (Cardinality) (videos not yet available)

AA00Cardinality.pdf  AofAteq1.pdf 
AofAweek2.txt 

AA02Recurrences.pdf  AofAteq2.pdf 
AofAweek3.txt

4.3 Asymptotics of finite sums

AA04Asymptotics.pdf  AofAteq3.pdf 