Analysis of Algorithms
$49
ENROLL NOWCourse Overview
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. People who are interested in digging deeper into the content may wish to obtain the textbook Analysis of Algorithms, Second Edition (upon which the course is based) or to visit the website aofa.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.
Course FAQs
What are the prerequisites for 'Analysis of Algorithms'?
Prerequisites for this continuing education class are set by Princeton University. Most professional development online classes benefit from some prior knowledge. Please check the provider's page for specific requirements.
Will I receive a certificate for this CE class?
Yes, upon successful completion, Princeton University typically offers a shareable certificate to showcase your new skills and fulfill your continuing education requirements.
How long does this online course take to complete?
Completion times for online continuing education courses vary. The provider's website will have the most accurate estimate of the time commitment needed.
