MIT Subject Listing & Schedule
Fall 2023 Search Results

Searched for:

1 subject found.

18.410[J] Design and Analysis of Algorithms

(, )
(Same subject as 6.1220[J])
Prereq: 6.1200 and 6.1210
Units: 4-0-8
Lecture: TR11-12.30 (34-101) Recitation: F10 (36-155) or F3 (36-153) or F10 (36-156) or F11 (36-155, 36-156) or F12 (26-210, 36-156) or F1 (26-210, 36-156) or F2 (36-153) or F10 (36-112) or F1 (36-153) or F2 (36-112) +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.
S. Raghuraman
Textbooks (Fall 2023)