Monthly Subscription Starting at AED 99 + VAT

Analysis of Algorithms
  • Level Expert
  • المدة 21 ساعات hours
  • الطبع بواسطة Princeton University
  • Offered by

عن

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

    • 4 Videos
    • 2 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Analysis of Algorithms

1 Discussions

  • Exercises from Lecture 1

4 Videos

  • History and Motivation
  • A Scientific Approach
  • Example: Quicksort
  • Resources

2 Readings

  • Getting Started
  • Exercises from Lecture 1

Recurrences

    • 5 Videos
    • 1 Readings
    • 1 Discussion
    • 3 Assignment
Show info about module content

3 Assignment

  • Pop Quiz on Telescoping
  • Pop Quiz on the Master Theorem
  • Recurrences

1 Discussions

  • Exercises from Lecture 2

5 Videos

  • Computing Values
  • Telescoping
  • Types of Recurrences
  • Mergesort
  • Master Theorem

1 Readings

  • Exercises from Lecture 2

Generating Functions

    • 5 Videos
    • 1 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Generating Functions

1 Discussions

  • Exercises from Lecture 3

5 Videos

  • Ordinary Generating Functions
  • Counting with Generating Functions
  • Catalan Numbers
  • Solving Recurrences
  • Exponential Generating Functions

1 Readings

  • Exercises from Lecture 3

Asymptotics

    • 4 Videos
    • 1 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Asymptotics

1 Discussions

  • Exercises from Lecture 4

4 Videos

  • Standard Scale
  • Manipulating Expansions
  • Asymptotics of Finite Sums
  • Bivariate Asymptotics

1 Readings

  • Exercises from Lecture 4

Analytic Combinatorics

    • 4 Videos
    • 2 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Analytic Combinatorics

1 Discussions

  • Exercises from Lecture 5

4 Videos

  • The Symbolic Method
  • Labelled Objects
  • Coefficient Asymptotics
  • Perspective

2 Readings

  • Errata
  • Exercises from Lecture 5

Trees

    • 4 Videos
    • 1 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Trees

1 Discussions

  • Exercises from Lecture 6

4 Videos

  • Trees and Forests
  • Binary Search Trees
  • Path Length
  • Other Types of Trees

1 Readings

  • Exercises from Lecture 6

Permutations

    • 5 Videos
    • 1 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Permutations

1 Discussions

  • Exercises from Lecture 7

5 Videos

  • Basics
  • Sets of Cycles
  • Left-Right-Minima
  • Other Parameters
  • BGFs and Distributions

1 Readings

  • Exercises from Lecture 7

Strings and Tries

    • 5 Videos
    • 1 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Strings and Tries

1 Discussions

  • Exercises from Lecture 8

5 Videos

  • Bitstrings with Restrictions
  • Languages
  • Tries
  • Trie Parameters
  • Exercises

1 Readings

  • Exercises from Lecture 8

Words and Mappings

    • 6 Videos
    • 1 Readings
    • 1 Discussion
    • 1 Assignment
Show info about module content

1 Assignment

  • Strings and Words

1 Discussions

  • Exercises from Lecture 9

6 Videos

  • Words
  • Birthday Problem
  • Coupon Collector Problem
  • Hash Tables
  • Mappings
  • Exercises

1 Readings

  • Exercises from Lecture 9

Auto Summary

Unlock the secrets of algorithm analysis with this expert-level course focused on Data Science & AI. Delve deep into the calculus of quantitative predictions for large combinatorial structures, exploring generating functions, real asymptotics, and the symbolic method. Through engaging content, you will learn to analyze algorithms and basic structures like permutations, trees, strings, words, and mappings. Offered by Coursera, this in-depth course spans 1260 minutes of rich learning material, all available for free. While no certificate is provided upon completion, dedicated learners can enhance their understanding with the recommended textbook, "Analysis of Algorithms, Second Edition," or access additional resources at aofa.cs.princeton.edu. Ideal for those with an advanced grasp of the subject, this course caters to data science and AI enthusiasts looking to deepen their expertise. Choose from Starter or Professional subscription options to embark on this analytical journey. Join today and transform your comprehension of algorithms and their applications.

Robert Sedgewick
Instructor

Robert Sedgewick