MIT OpenCourseWare

Browse materialsMIT 6.046J · Spring 2012

Design and Analysis of Algorithms

Subject: Mathematics

Art: Palmer, Edward, 1803-1872, Figures 113-123. Plate Electrical Machines, 1840 · Public domain

Instructors: Prof. Dana Moshkovitz, Prof. Bruce Tidor
Term: Spring 2012
Level: Undergraduate
What's inside: 9 problem sets · 7 exams · 15 solutions · 2 lecture notes · 1 reading · 30 other files · 7 web pages
Materials open: MIT OCW

Other versions of this course

6.046J · Spring 2015 · Study here
6.046J · Spring 2012 · Study here (this version)

Start here

Start course: Lecture 1: Introduction, median finding, solving recurrences Find a topic

Progress is saved in this browser.

Export or import progress

About this course

Source: MIT OpenCourseWare 6.046J Design and Analysis of Algorithms, Spring 2012, Prof. Dana Moshkovitz, Prof. Bruce Tidor — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.

Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.

Has MIT solutions 15 files in this course are named by MIT as solutions.

Before you start

Prerequisites are not listed here. Check MIT's own syllabus for this course.

This course’s cited books, in our reading lists: Introduction to Algorithms

How this course was organized

What's here, and what isn't

MIT's own materials here did not support a verified, course-wide order, so they are grouped by section instead.

Not included here

8 items from the source could not be safely included:

MIT's page format for this item wasn't recognized clearly enough to place it safely. (6 items)
Referenced in a table, but without MIT's own verified order, so it isn't used to claim a sequence. (2 items)

Materials by section

Grouped by section, as MIT organized them. Not sequenced or ordered.

Lecture Notes

24 files

Recitations

Assignments

19 files

Exams

15 files

MIT OpenCourseWare, Prof. Dana Moshkovitz, Prof. Bruce Tidor, 6.046J Design and Analysis of Algorithms, Spring 2012.

License: CC BY-NC-SA 4.0 · Edition: Spring 2012 · Open the original course on OCW ↗

Organized by RedLectern, independent of MIT and not endorsed by MIT.

Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.

Design and Analysis of Algorithms

Before you start

What's here, and what isn't

Not included here

Materials by section

Lecture Notes

Recitations

Assignments

Exams

Lecture 1: Introduction, median finding, solving recurrences

Lecture 2: Median finding, interval scheduling

Lecture 3: Greedy algorithms, minimum spanning trees: Kruskal’s

Lecture 4: Minimum spanning trees: Prim’s

Lecture 5: Fast Fourier transform

Lecture 6: Dynamic programming, all pairs shortest paths: Floyd-Warshall

Lecture 7: All-pairs shortest paths II: Johnson’s

Lecture 8: Randomized algorithms

Lecture 9: Randomized algorithms, high probability bounds

Lecture 10: Hashing

Lecture 11: Amortized analysis

Lecture 12: Competitive analysis

Lecture 13: Network flows

Lecture 14: Preparation for take-home exam

Lecture 15: van Emde Boas data structure

Lecture 16: Advanced data structures: disjoint sets

Lecture 17: P vs. NP

Lecture 18: Approximation algorithms

Lecture 19: Compression

Lecture 20: Sub-linear time algorithms

Lecture 21: Clustering

Lecture 22: Derandomization

Lecture 23: Computational geometry