MIT Subject Listing & Schedule
Fall 2019 Search Results

Searched for:

1 subject found.

6.046[J] Design and Analysis of Algorithms

(, )
(Same subject as 18.410[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 (32-123) Recitation: F10 (3-442) or F11 (4-159, 3-442, 36-156) or F12 (36-156, 4-159) or F1 (4-159, 4-149) or F2 (36-153) or F3 (36-153) or F4 (32-144) +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.
P. Indyk
No textbook information available