Online Course Algorithms Upcoming

Open Education is a concept that I do admire very much.

I just decided to go into some interesting areas coming month, since Stanford University just launched a new online course on their Coursera platform. 

Algorithms: Design and Analysis, Part 2

For those who are interested in the world of machines, please check out this course at

https://www.coursera.org/course/algo2

Tim Roughgarden, Associate Professor

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments. You’ll learn what NP-completeness and the famous “P vs. NP” problem mean for the algorithm designer. Finally, we’ll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics. Learn how shortest-path algorithms from the 1950s (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today; why efficient algorithms are fundamental to modern genomics; and how to make a million bucks in prize money by “just” solving a math problem!

Thanks to Simon Dalmolen for giving me this tip!