Resources | Introduction to Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

Course Info

Instructors

Departments

Electrical Engineering and Computer Science

As Taught In

Fall 2011

Level

Undergraduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures

Learning Resource Types

Exam Solutions

Exams

Lecture Notes

Lecture Videos

Problem Set Solutions

Problem Sets

Problem-solving Videos

Programming Assignments with Examples

Download Course

Download

Download course

This package contains the same content as the online version of the course, except for the audio/video materials, which can be downloaded using the links below. Once downloaded, follow the steps below. For more help using these materials, read our FAQs.

To open the homepage, click on the index.html file.
To find the course resource files such as PDFs, open the static_resources folder.

Note: The downloaded course may not work on mobile devices. We recommend using a computer with the downloaded course package.

Lecture Videos

Lecture 1: Algorithmic Thinking, Peak Finding

Lecture 2: Models of Computation, Document Distance

Lecture 3: Insertion Sort, Merge Sort

Lecture 4: Heaps and Heap Sort

Lecture 5: Binary Search Trees, BST Sort

Lecture 6: AVL Trees, AVL Sort

Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting

Lecture 8: Hashing with Chaining

Lecture 9: Table Doubling, Karp-Rabin

Lecture 10: Open Addressing, Cryptographic Hashing

Problem-Solving Videos

Recitation 1: Asymptotic Complexity, Peak Finding

Recitation 2: Python Cost Model, Document Distance

Recitation 3: Document Distance, Insertion and Merge Sort

Recitation 5: Recursion Trees, Binary Search Trees

Recitation 6: AVL Trees

Recitation 7: Comparison Sort, Counting and Radix Sort

Recitation 8: Simulation Algorithms

Recitation 9: Rolling Hashes, Amortized Analysis

Recitation 9b: DNA Sequence Matching

Recitation 10: Quiz 1 Review

Exams

Final Exam

Final Exam Solutions

Quiz 1

Quiz 1 Solutions

Quiz 2

Quiz 2 Solutions

Lecture Notes

Lecture 01: Algorithmic thinking, peak finding

Lecture 02 Original: Models of computation, Python cost model, document distance

Lecture 02: Models of computation, Python cost model, document distance

Lecture 03: Insertion sort, merge sort

Lecture 04: Heaps and heap sort

Lecture 05: Binary search trees, BST sort

Lecture 06 Original: AVL trees, AVL sort

Lecture 06: AVL trees, AVL sort

Lecture 07 Original: Counting sort, radix sort, lower bounds for sorting and searching

Lecture 07: Counting sort, radix sort, lower bounds for sorting and searching

Problem Set Solutions

Problem Set 1 Solutions

Problem Set 2 Code Solutions

Problem Set 2 Solutions

Problem Set 3 Code Solutions

Problem Set 3 Solutions

Problem Set 4 Code Solutions

Problem Set 4 Solutions

Problem Set 5 Code Solutions

Problem Set 5 Solutions

Problem Set 6 Code Solutions

Problem Sets

Problem Set 1

Problem Set 1 Code

Problem Set 1 Solutions

Problem Set 2

Problem Set 2 Code

Problem Set 2 Code Solutions

Problem Set 2 Solutions

Problem Set 3

Problem Set 3 Code

Problem Set 3 Code Solutions

Problem-Solving Notes

Recitation 1 Code

Recitation 1 Notes: Asymptotic Complexity, Peak Finding

Recitation 2 Code

Recitation 2 Handout: Python Cost Model, Document Distance

Recitation 2 Notes: Python Cost Model, Document Distance

Recitation 5 Code

Recitation 5 Handout: Recursion Trees, Binary Search Trees

Recitation 5 Notes: Recursion Trees, Binary Search Trees

Recitation 6 Notes: AVL Trees

Recitation 7 Notes: Comparison Sort, Counting and Radix Sort

Tools

Lecture 2 Code

Lecture 6 Code

Course Info

Instructors

Departments

Electrical Engineering and Computer Science

As Taught In

Fall 2011

Level

Undergraduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures

Learning Resource Types

Exam Solutions

Exams

Lecture Notes

Lecture Videos

Problem Set Solutions

Problem Sets

Problem-solving Videos

Programming Assignments with Examples

Download Course

MIT Open Learning

Over 2,500 courses & materials

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

© 2001–2026 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2026 Massachusetts Institute of Technology