Epilogue: Design and Analysis of Algorithms I

Epilogue: Design and Analysis of Algorithms I - Email by Tim Roughgarden
Pasted by Class Central - www.class-central.com


Dear <name>,

THANKS: Teaching this online course has been an amazing experience for me, and I'm thrilled that so many of you have found it useful and intellectually challenging. Please accept my sincere thanks for being a part of it!

CERTIFICATES: I'm currently finalizing the format for the certificates of accomplishment, and I expect Coursera to send them out very soon. (See the "Course Logistics" page to review the requirements for receiving a certificate.)

FUTURE COURSES: I've been blown away by all the enthusiasm for more algorithms courses. Let me let you in on my current (tentative) plans.

PART I: I hope to re-run Algorithms Part I soon, in a month or so. So if you (or your friends) didn't have time to complete the course, or found out about it too late, this will be your next chance! This second offering will be similar to the first, with some minor improvements motivated by student suggestions (more in-video quizzes, and maybe even that third batch of optional theory problems!).

PART II: I hope to debut a five-week Algorithms Part II soon after the Part I re-run finishes (in late summer or so). The planned topics are the greedy algorithm design paradigm (with applications to minimum spanning trees, scheduling, and data encoding); the dynamic programming design paradigm (with applications to Internet routing and genome sequencing); and NP-complete problems and what to do about them (fast heuristics with provable guarantees, fast exact algorithms for special cases, and exact algorithms that beat brute-force search).

FUTURE ANNOUNCEMENTS: For news about the Part I re-run and the Part II debut, you might keep your eye on the main Coursera page (https://www.coursera.org/) and my Google+ page.

Best regards,
Tim Roughgarden