• Syllabus (postscript)
• Survey (postscript)
• Lecture Slides (Week 1, introduction) (postscript, PDF)
• Lecture Slides (Week 1, recursion, induction) (postscript, PDF)
• Lecture Slides (Week 1, asymptotic analysis) (postscript, PDF)
• Lecture Slides (Week 2, lists) (postscript, PDF)
• Lecture Slides (Week 2, stacks) (postscript, PDF)
• Lecture Slides (Week 2, queues) (postscript, PDF)
• Lecture Slides (Week 3, trees) (postscript, PDF)
• Lecture Slides (Week 3, binary search trees) (postscript, PDF)
• Lecture Slides (Week 3, self-adjusting trees) (postscript, PDF)
  (Bonus: The Red-Black Tree Song by Sean D. Sandys)
• Lecture Slides (Week 4, hash tables) (postscript, PDF)
• Lecture Slides (Week 4, hash tables -- use and collision handling) (postscript, PDF)
• Lecture Slides (Week 4, hash tables -- open addressing and applications) (postscript, PDF)
• Lecture Slides (Week 5, heaps) (postscript, PDF)
• Lecture Slides (Week 5, heaps -- other operations and variations) (postscript, PDF)
• Lecture Slides (Week 5, heaps -- applications) (postscript, PDF)
• Midterm Concepts (postscript)
• Lecture Slides (Week 7, breaking out) (postscript, PDF)
• Lecture Slides (Week 7, selection) (postscript, PDF)
• Lecture Slides (Week 8, sorting) (postscript, PDF)
• Lecture Slides (Week 8, sorting -- shellsort, mergesort) (postscript, PDF)
• Lecture Slides (Week 8, sorting -- quicksort) (postscript, PDF)
• Lecture Slides (Week 9, graphs) (postscript, PDF)
• Lecture Slides (Week 9, traversals, shortest paths) (postscript, PDF)
• Lecture Slides (Week 9, shortest paths, minimum spanning trees) (postscript, PDF)
• Lecture Slides (Week 10, algorithm classification) (postscript, PDF)
• Final Exam Concepts (postscript)
• Lecture Slides (Week 10, wrap-up) (postscript, PDF)