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 Cyber Incident Response course will give students an understanding of how incidents are responded to at a high level, as well as allow them to build important technical skills through the... more
This specialization is intended for those who want to take their skills beyond just coding. The act of writing software is a large ecosystem of skills, tools, and philosophies. These six courses... more
This specialization is intended for students interested to learn Java testing, mocking, improving their Java code, developing test-first Java artifacts, and building quality Enterprise... more
Crisis Communications is designed to empower professionals with the knowledge and skills to effectively navigate and respond to crisis situations through interviews.Created by: IESE Business School more
Economics and economic theory is fundamental to decision making in business, policy, and everyday life. If you\'re interested in a career in business, law, accounting, or investment then studying... more
Powered by
