Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

Course Info

Instructors

Departments

As Taught In

Spring 2012

Level

Undergraduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures

Learning Resource Types

Exams with Solutions

Lecture Notes

Problem Sets

Problem Set Solutions

Download Course

Lecture Notes

6.046J Complete Lecture Notes

6.046J Lecture 1: Introduction, median finding

6.046J Lecture 10: Hashing and amortization

6.046J Lecture 11: Amortized analysis

6.046J Lecture 12: Competitive analysis

6.046J Lecture 13: Network flow

6.046J Lecture 14: Interlude: problem solving

6.046J Lecture 15: van Emde Boas data structure

6.046J Lecture 16: Disjoint-set data structures

6.046J Lecture 17: Complexity and NP-completeness

6.046J Lecture 18: Polynomial-time approximations

6.046J Lecture 19: Compression and Huffman coding

6.046J Lecture 2: Median finding, interval scheduling

6.046J Lecture 20: Sublinear-time algorithms

6.046J Lecture 21: Clustering

6.046J Lecture 22: Derandomization

6.046J Lecture 23: Computational geometry

6.046J Lecture 3: Minimum spanning trees I

6.046J Lecture 4: Minimum spanning trees II

6.046J Lecture 5: Fast Fourier transform

6.046J Lecture 6: All-pairs shortest paths I

6.046J Lecture 7: All-pairs shortest paths II

6.046J Lecture 8: Randomized algorithms I

6.046J Lecture 9: Randomized algorithms II

Course Info

Instructors

Departments

As Taught In

Spring 2012

Level

Undergraduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures

Learning Resource Types

Exams with Solutions

Lecture Notes

Problem Sets

Problem Set Solutions

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2025 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2025 Massachusetts Institute of Technology