MIT Subject Listing & Schedule
IAP / Spring 2019 Search Results

Searched for: "18.410"    Subjects offered any term

1 subject found.

18.410[J] Design and Analysis of Algorithms

(, )
(Same subject as 6.046[J])
Prereq: 6.006
Units: 4-0-8
https://learning-modules.mit.edu/class/index.html?uuid=/course/6/fa17/6.046J#info
Lecture: TR11-12.30 (34-101) Recitation: F10 (36-112) or F11 (36-112) or F12 (36-112) or F1 (36-112) or F2 (36-112) or F3 (36-112) or F11 (26-168) or F12 (26-168) or F1 (26-168) +final

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.
R. Rubinfeld
Spring: B. Tidor
No textbook information available