Introduction to Algorithms (MIT 6.046J)

Lectures

Lecture links to the MIT OCW site include the video or audio lecture itself in several formats, along with a transcript and a PDF set of lecture notes.

• Lecture 15: Dynamic Programming, Longest Common Subsequence

[Videos also embedded below]

• Lecture 16: Greedy Algorithms, Minimum Spanning Trees

Readings

All readings, unless otherwise specified, are from Introduction to Algorithms, 2nd Edition.

• After Lecture 15:
  • Chapter 15
• After Lecture 16:
  • Sections 16.1-16.3 and 22.1
  • Chapter 23
• Optional:
  • Appendix B for review of graphs as needed

Other material

• Optional:
  • Peteris Krumins' comments and lecture notes for Lecture 15
  • Peteris Krumins' comments and lecture notes for Lecture 16

Assignment Notes

Assignments are listed under the Curious Reef "lesson" containing the lecture on which they were due, rather than the lesson containing the lecture when they were assigned.

Problem Set 6 is based on material from the previous week's worth of material. It was originally due during Lecture 15, on 11/7/2005.

Videos

Lecture 15

Lecture 16