Princeton University is offering an online course called "Analysis of Algorithms". This 6-week-long course will commence from 7th February, 2014 onwards.
About the Course:
Analysis of Algorithms aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines, including probability theory, statistical physics, computational biology and information theory. This course covers recurrence relations, generating functions, asymptotics, and fundamental structures such as trees, permutations, strings, tries, words, and mappings, in the context of applications to the analysis of algorithms.
Robert Sedgewick will be the course instructor.
The course will have workload of 6-8 hours of work/week.
It will be taught in English and subtitles will be available in English.
For further details and to apply click here