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

Course Info

Instructors

Departments

Electrical Engineering and Computer Science

As Taught In

Spring 2008

Level

Undergraduate

Topics

Learning Resource Types

Problem Sets

Exams with Solutions

Lecture Notes

Presentation Assignments with Examples

Download Course

Download

file_download Download course

This package contains the same content as the online version of the course. For help downloading and using course materials, read our FAQs.

Assignments

Binary search trees code

Document distance code

Gas simulation code

Heap code

Image resizing code

Rubik's Cube code

Exams

Final Practice Problem Solutions

Final Practice Problems

Quiz 1 Practice Problem Solutions

Quiz 1 Practice Problems

Quiz 2 Practice Problem Solutions

Quiz 2 Practice Problems

Lecture Notes

Simple Python code for graphs

Lecture 1: Introduction and the Document Distance Problem

Lecture 2: More on the Document Distance Problem

Lecture 3: Scheduling and Binary Search Trees

Lecture 4: Balanced Binary Search Trees

Lecture 5: Hashing I: Chaining, Hash Functions

Lecture 6: Hashing II: Table Doubling, Karp-Rabin

Lecture 7: Hashing III: Open Addressing

Lecture 8: Sorting I: Heaps

Recitations

Code for AVL trees

Code for binary search trees

Code for breadth-first search

Code for depth-first search

Longest zig-zag subsequence

Matrix chain multiplication

Mutable dictionary keys

Open addressing code

Rolling hash code

Zipped data (numbers)

MIT Open Learning

Over 2,500 courses & materials

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

© 2001–2023 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2023 Massachusetts Institute of Technology