Main Profile

At A Glance

Design and Analysis of Algorithms

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing.

Start Date: Feb 01, 2012 Topics: Design
Cost: Free

Contact

Design and Analysis of Algorithms's Full Profile

Overview

Description

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing.

Details

  • Dates: Feb 01, 2012 to May 25, 2012
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Advanced
  • Size: Massive Open Online Course
  • Instructors: Prof. Bruce Tidor, Prof. Dana Moshkovitz
  • Cost: Free
  • Institution: MIT OCW
  • Topics: Design

Provider Overview

About MIT OCW: MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

Latest Tweet

MIT OCW Offers Courses In: Art

Questions about Design and Analysis of Algorithms

Want more info about Design and Analysis of Algorithms? Get free advice from education experts and Noodle community members.

  • Answer