6.046 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.
This class has 6.006 as a prerequisite.
Lecture occurs 11:00 AM to 12:30 PM on Tuesdays and Thursdays in 32-123.
This class counts for a total of 12 credits.
You can find more information at the http://www.google.com/search?&q=MIT+%2B+6.046&btnG=Google+Search&inurl=https site.
© Copyright 2015 Yasyf Mohamedali