MIT Subject Listing & Schedule
Fall 2020 Search Results

Searched for:

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://eecs.scripts.mit.edu/eduportal/__How_Courses_Will_Be_Taught_Online_or_Oncampus__/F/2020/#6.046J
Lecture: TR11-12.30 (VIRTUAL) Recitation: F10 (VIRTUAL) or F1 (VIRTUAL) or F2 (VIRTUAL) or F3 (VIRTUAL) or F10 (VIRTUAL) or F11 (VIRTUAL) or F12 (VIRTUAL) or F1 (VIRTUAL) +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.
M. Karchmer
Textbooks (Fall 2020)