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
The purpose of this series of courses is to teach the basics of Computational Statistics for the purpose of performing inference to aspiring or new Data Scientists. This is not intended to be a... more
This course equips participants with essential skills for the modern job market. Dive into crafting compelling CVs, mastering networking, acing interviews, and understanding market trends to propel... more
The course focuses on teaching students how to successfully analyze a business process, research methods of improving a process, and adapt/integrate the improvement. methods into the business... more
Understand the structure and techniques used in Machine Learning, Text Mining, and Decision Science for Marketing. Explore the fascinating world of Machine Learning and its transformative... more
This specialized program is aimed at computer people who want to enter the field of information systems and learn their different types of requirements, architectures, performance, techniques and... more
Powered by
