Lecture Notes

These notes were developed by Ben Zinberg, a student in the Spring 2012 class, starting from the notes that Prof. Moshkovitz and Prof. Tidor prepared for their own use in presenting the lectures.

Complete notes (PDF)

LEC #	LECTURE NOTES
1	Introduction, median finding (PDF)
2	Median finding, interval scheduling (PDF)
3	Minimum spanning trees I (PDF)
4	Minimum spanning trees II (PDF)
5	Fast Fourier transform (PDF)
6	All-pairs shortest paths I (PDF)
7	All-pairs shortest paths II (PDF)
8	Randomized algorithms I (PDF)
9	Randomized algorithms II (PDF)
10	Hashing and amortization (PDF)
11	Amortized analysis (PDF)
12	Competitive analysis (PDF)
13	Network flow (PDF)
14	Interlude: problem solving (PDF)
15	van Emde Boas data structure (PDF)
16	Disjoint-set data structures (PDF)
17	Complexity and NP-completeness (PDF)
18	Polynomial-time approximations (PDF)
19	Compression and Huffman coding (PDF)
20	Sublinear-time algorithms (PDF)
21	Clustering (PDF)
22	Derandomization (PDF)
23	Computational geometry (PDF)

Browse Course Material

Course Info

Instructors

Departments

As Taught In

Level

Topics

Learning Resource Types

Design and Analysis of Algorithms

Course Info

Instructors

Departments

As Taught In

Level

Topics

Learning Resource Types