Registrar Home | Registrar Search:
Home | Subject Search | Help | Symbols Help | Pre-Reg Help | Final Exam Schedule | My Selections

MIT Subject Listing & Schedule
IAP/Spring 2020 Search Results

Searched for:

1 subject found.

18.410[J] Design and Analysis of Algorithms
______

Undergrad (Fall, Spring)
(Same subject as 6.046[J])
Prereq: 6.006
Units: 4-0-8
https://learning-modules.mit.edu/class/index.html?uuid=/course/6/sp19/6.046#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.
Fall: P. Indyk
Spring: M. Karchmer
Textbooks (Spring 2020)