|
Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: 1 subject found.
6.1220[J] Design and Analysis of Algorithms
(
,
)
(Same subject as 18.410[J])
Prereq: 6.1200 and 6.1210
Units: 4-0-8
Lecture: TR11-12.30 (32-123) Recitation: F9 (36-112) or F10 (36-112) or F11 (36-112) or F12 (36-112) or F1 (36-112) or F2 (36-112) or F3 (36-112) or F10 (24-121) or F11 (4-265) or F12 (4-265) or F1 (4-265) or F2 (24-121) or F3 (24-121) +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.
Fall: S. Raghuraman
Spring: S. Raghuraman
Textbooks (Spring 2025)
| ||||||||
