Lecture Notes | 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

Lecture Notes

Numerics Demo

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

Lecture 9: Sorting II: Heaps

Lecture 10: Sorting III: Linear Bounds Linear-Time Sorting

Lecture 11: Sorting IV: Stable Sorting, Radix Sort

Lecture 12: Searching I: Graph Search and Representations

Lecture 13: Searching II: Breadth-First Search and Depth-First Search

Lecture 14: Searching III: Toplogical Sort and NP-completeness

Lecture 15: Shortest Paths I: Intro

Lecture 16: Shortest Paths II: Bellman-Ford

Lecture 17: Shortest Paths III -Dijkstra and Special Cases

Lecture 18: Shortest Paths IV - Speeding up Dijkstra

Lecture 19: Dynamic Programming I: Memoization, Fibonacci, Crazy Eights, Guessing

Lecture 20: Dynamic Programming II: Longest Common Subsequence, Parent Pointers

Lecture 21: Dynamic Programming III: Text Justication, Parenthesization, Knapsack, Pseudopolynomial Time, Tetris Training

Lecture 22: Dynamic Programming IV: Piano Fingering, Structural DP (Trees), Vertex Cover, Dominating Set, Beyond

Lecture 23: Numerics I

Lecture 24: Numerics II

Lecture 25: Beyond 6.006: Follow-on Classes, Geometric Folding Algorithms

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