Coursera
Coursera Logo

Princeton University - Analysis of Algorithms 

  • Offered byCoursera

Analysis of Algorithms
 at 
Coursera 
Overview

Duration

21 hours

Total fee

Free

Mode of learning

Online

Schedule type

Self paced

Difficulty level

Advanced

Official Website

Explore Free Course External Link Icon

Credential

Certificate

Analysis of Algorithms
 at 
Coursera 
Highlights

  • Earn a shareable certificate upon completion.
  • Flexible deadlines according to your schedule.
Details Icon

Analysis of Algorithms
 at 
Coursera 
Course details

More 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. It does not offer a certificate upon completion.

Analysis of Algorithms
 at 
Coursera 
Curriculum

Analysis of Algorithms

History and Motivation

A Scientific Approach

Example: Quicksort

Resources

Getting Started

Exercises from Lecture 1

Analysis of Algorithms

Recurrences

Computing Values

Telescoping

Types of Recurrences

Mergesort

Master Theorem

Exercises from Lecture 2

Pop Quiz on Telescoping

Pop Quiz on the Master Theorem

Recurrences

Generating Functions

Ordinary Generating Functions

Counting with Generating Functions

Catalan Numbers

Solving Recurrences

Exponential Generating Functions

Exercises from Lecture 3

Generating Functions

Asymptotics

Standard Scale

Manipulating Expansions

Asymptotics of Finite Sums

Bivariate Asymptotics

Exercises from Lecture 4

Asymptotics

Analytic Combinatorics

The Symbolic Method

Labelled Objects

Coefficient Asymptotics

Perspective

Errata

Exercises from Lecture 5

Analytic Combinatorics

Trees

Trees and Forests

Binary Search Trees

Path Length

Other Types of Trees

Exercises from Lecture 6

Trees

Permutations

Basics

Sets of Cycles

Left-Right-Minima

Other Parameters

BGFs and Distributions

Exercises from Lecture 7

Permutations

Strings and Tries

Bitstrings with Restrictions

Languages

Tries

Trie Parameters

Exercises

Exercises from Lecture 8

Strings and Tries

Words and Mappings

Words

Birthday Problem

Coupon Collector Problem

Hash Tables

Mappings

Exercises

Exercises from Lecture 9

Strings and Words

Other courses offered by Coursera

– / –
3 months
Beginner
– / –
20 hours
Beginner
– / –
2 months
Beginner
– / –
3 months
Beginner
View Other 6716 CoursesRight Arrow Icon
qna

Analysis of Algorithms
 at 
Coursera 

Student Forum

chatAnything you would want to ask experts?
Write here...