Analysis of Algorithms
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. 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.Created by: Princeton University
Related Online Courses
In this course, you will learn about traditional and emerging techniques in population-level data collection that can be used to strengthen public health programs and policies. Experts from around... more
This course introduces administrative tasks that a system administrator can perform with Linux hosted on IBM Power servers. This includes virtualization concepts such as logical partitioning,... more
Welcome to the third course in the Building Cloud Computing Solutions at Scale Specialization! In this course, you will learn how to apply Data Engineering to real-world projects using the Cloud... more
As professionals in the fields of development and design, it is imperative for us to have a means of effectively showcasing our expertise to potential employers, and there is no more compelling... more
Embark on a comprehensive journey into the intricate realm of fire and life safety systems with our specialized curriculum. Designed to equip learners with a multifaceted understanding of fire... more
Powered by
