• Lecture 26: Final Lecture!
• Official Final Exam Worksheet:
  • In PostScript
  • In Adobe Acrobat PDF
• Lecture 25: More algorithmic techniques (Backtracking, Randomized)
• Lecture 24: Algorithmic techniques (Greedy, Divide&Conquer, Dynamic Programming)
• Lecture 23: Dijkstra's and Kruskal's
• Some graphs you might have seen under different circumstances:
  • In PowerPoint
  • In HTML
  Unofficial Final Review Worksheet (shhh. don't tell Darth):
  • In PostScript
  • In Adobe Acrobat
• Lecture 22: Graphs
• Sorting and the Memory Hierarchy:
  • In PowerPoint
  • In HTML
• Demo files for Maze Visualization/Maze Generation.
  • Test file 1. Maze file
  • Test file 2. Maze file. A GIF of what it looks like, with walls colored, & rooms colored differently.
• Sorting by Comparison Slides (Selection Sort, Quick Sort, Merge Sort and lower bound on sorting by comparison):
  • In PowerPoint
  • In HTML
• Sorting in (kind of) Linear Time Slides (BinSort, Radix Sort, Radix Sorting other data types):
  • In PowerPoint
  • In HTML
• Lecture 19: k-D Trees and Quad Trees
• High Points of the Study Session
• Quiz/Homework #5 (Postscript; Solutions)
• Project IV
  • Compression option
  • Grab bag option
  • Maze generation option
  • Maze visualization option
• Lecture 18: Lots of new data structures
• Lecture 17: Disjoint Set Union/Find (the dynamic equivalence problem)
• Lecture 16: Extendible hashing (Hash Tables continued)
• Quiz/Homework #4 (Postscript; Solutions (Postscript))
• Lecture 15: When Keys Collide (Hash Tables continued)
• Lecture 14: Hash Tables
• Project III
• Lucky Lecture 13: Midterm (not much here)
• Lecture 12: Splay Trees Continued
• Lecture 11: Splay Trees
• Official Midterm Review
  
  • In Postscript
  • In Adobe Acrobat PDF
• Lecture 10: AVL Trees
• Midterm Review Worksheet (Word format)
• Lecture 9: B-Trees
• Lecture 8: More BSTs
• Lecture 7: Binary Search Trees
• Quiz/Homework #3 (Postscript; Solutions (Postscript))
• Lecture 6: More Heaps
• Project II
• Lecture 5: Heaps
• Quiz/Homework #2 (Postscript; Solutions (Postscript))
• Lecture 4: Priority Queues
• Iterative deepening search notes: pages 78-80 of Russell and Norvig Artificial Intelligence: A Modern Approach (no electronic version)
• Lecture 3: Asymptotic Analysis II
• Quiz/Homework #1 (Postscript; Solutions (Postscript))
• Lecture 2: Asymptotic Analysis I
• The Phantom Survey
• Lecture 1: Lists & Multi-lists
• Project I
• Programming Guidelines
• Lecture 0: Stacks & Queues
• Syllabus