6.046[J] Design and Analysis of Algorithms


Class Info

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.

This class has 6.006 as a prerequisite.

6.046[J] will not be offered this semester. It will be instructed by E. Demaine and M. Goemans.

Lecture occurs 11:00 AM to 12:30 PM on Tuesdays and Thursdays in 34-101.

This class counts for a total of 12 credits.

You can find more information on MIT OpenCourseWare at the Design and Analysis of Algorithms site or on the 6.046[J] Stellar site.

MIT 6.046[J] Design and Analysis of Algorithms Related Textbooks
MIT 6.046[J] Design and Analysis of Algorithms On The Web
Design and Analysis of Algorithms
Tags
by-nc-sa tidor license massachusetts institute of technology creative commons bruce tidor

© Copyright 2015