About this Course
4.8
39 ratings
5 reviews
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Advanced Level

Advanced Level

Hours to complete

Approx. 26 hours to complete

Suggested: 8 hours/week...
Available languages

English

Subtitles: English
100% online

100% online

Start instantly and learn at your own schedule.
Flexible deadlines

Flexible deadlines

Reset deadlines in accordance to your schedule.
Advanced Level

Advanced Level

Hours to complete

Approx. 26 hours to complete

Suggested: 8 hours/week...
Available languages

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
Hours to complete
2 hours to complete

Analysis of Algorithms

We begin by considering historical context and motivation for the scientific study of algorithm performance. Then we consider a classic example that illustrates the key ingredients of the process: the analysis of Quicksort. The lecture concludes with a discussion of some resources that you might find useful during this course....
Reading
4 videos (Total 76 min), 2 readings, 1 quiz
Video4 videos
A Scientific Approach 16m
Example: Quicksort 30m
Resources 17m
Reading2 readings
Getting Started10m
Exercises from Lecture 110m
Quiz1 practice exercise
Analysis of Algorithms4m
Week
2
Hours to complete
2 hours to complete

Recurrences

We begin this lecture with an overview of recurrence relations, which provides us with a direct mathematical model for the analysis of algorithms. We finish by examining the fascinating oscillatory behavior of the divide-and-conquer recurrence corresponding to the mergesort algorithm and the general "master theorem" for related recurrences....
Reading
5 videos (Total 71 min), 1 reading, 3 quizzes
Video5 videos
Telescoping15m
Types of Recurrences 12m
Mergesort 18m
Master Theorem 14m
Reading1 reading
Exercises from Lecture 210m
Quiz3 practice exercises
Pop Quiz on Telescoping2m
Pop Quiz on the Master Theorem2m
Recurrences4m
Week
3
Hours to complete
2 hours to complete

Generating Functions

Since the 17th century, scientists have been using generating functions to solve recurrences, so we continue with an overview of generating functions, emphasizing their utility in solving problems like counting the number of binary trees with N nodes....
Reading
5 videos (Total 84 min), 1 reading, 1 quiz
Video5 videos
Counting with Generating Functions27m
Catalan Numbers14m
Solving Recurrences18m
Exponential Generating Functions7m
Reading1 reading
Exercises from Lecture 310m
Quiz1 practice exercise
Generating Functions6m
Week
4
Hours to complete
2 hours to complete

Asymptotics

Exact answers are often cumbersome, so we next consider a scientific approach to developing approximate answers that, again, mathematicians and scientists have used for centuries....
Reading
4 videos (Total 83 min), 1 reading, 1 quiz
Video4 videos
Manipulating Expansions 19m
Asymptotics of Finite Sums 16m
Bivariate Asymptotics 28m
Reading1 reading
Exercises from Lecture 410m
Quiz1 practice exercise
Asymptotics4m

Instructor

Avatar

Robert Sedgewick

William O. Baker *39 Professor of Computer Science
Computer Science

About Princeton University

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....

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • No. As per Princeton University policy, no certificates, credentials, or reports are awarded in connection with this course.

More questions? Visit the Learner Help Center.