Advanced Algorithms OpenCourseWare: MIT's Free Graduate Level Course on Advanced Algorithmic Design

Published Jan 07, 2009

RSS Feed

Study key algorithms and learn modes of algorithmic design with 'Advanced Algorithms.' This course is offered through MIT's OpenCourseWare program. Designed as a comprehensive study of algorithm-related topics, this course will cover many methods used in designing systematic algorithms. The course, which is offered for free online, is recommended for those who are considering a graduate degree, such as master's degree in Computer Science or Electrical Engineering.

Advanced Algorithms: Course Specifics

Degree Level Free Audio Video Downloads
Graduate Yes No No Yes

Lectures/Notes Study Materials Tests/Quizzes
Yes Yes No

Advanced Algorithms: Course Description

Algorithms are a key component of the field of computer science, and as technology continues to advance, their importance advances with it. The goal of 'Advanced Algorithms' is to provide an in-depth look at the techniques and applications of effective algorithms. This OpenCourseWare will begin with topics such as persistent data structures, splay trees and suffix trees. Later, students will examine Dial's Algorithm and Dijkstra's Algorithm, along with word-level parallelism and linear programming. Presented in lecture format by Professor David R. Karger, this course will consist mainly of problem sets as homework, as well as a project that will challenge students to further develop an algorithm they select from a research publication. Goals of this project include reading, clarifying and writing a new account of an existing algorithm. Alternatively, students can come up with a simplified solution to an algorithmic problem.

Materials for this OpenCourseWare are provided free online and include lecture notes, problem sets and recommended background reading on algorithmic design. For more information or to take this free course, visit the advanced algorithms course home page.

Featured School Choices: