Material Detail

6.046J Design and Analysis of Algorithms | Electrical Engineering and Computer Science

6.046J Design and Analysis of Algorithms | Electrical Engineering and Computer Science

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.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as 6.046J Design and Analysis of Algorithms | Electrical Engineering and Computer Science

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.