• Syllabus (postscript)
• Survey (postscript)
• Lecture Slides (9/27, course overview) (postscript, PDF)
• Lecture Slides (9/29, introduction) (postscript, PDF)
• Lecture Slides (9/29, asymptotic analysis) (postscript, PDF)
• Programming Assignment Guidelines (postscript)
• Lecture Slides (10/4, lists) (postscript, PDF)
• Lecture Slides (10/6, stacks) (postscript, PDF)
• Lecture Slides (10/11, queues) (postscript, PDF)
• Lecture Slides (10/13, trees) (postscript, PDF)
• Lecture Slides (10/15, binary search trees) (postscript, PDF)
• Lecture Slides (10/18, self-adjusting trees) (postscript, PDF)
• Lecture Slides (10/22, hash tables) (postscript, PDF)
• Lecture Slides (10/25-27, hash table applications and collisions) (postscript, PDF)
• Midterm Review Concepts (postscript)
• Lecture Slides (11/8, heaps) (postscript, PDF)
• Lecture Slides (11/10-12, other ops and variations) (postscript, PDF)
• Lecture Slides (11/15, heap applications) (postscript, PDF)
• Lecture Slides (11/17, the ADT toolbox) (postscript, PDF)
• Lecture Slides (11/19, selection, insertion sort) (postscript, PDF)
• Lecture Slides (11/22, shellsort, heapsort, mergesort) (postscript, PDF)
• Lecture Slides (11/24-11/29, quicksort, quickselect, bucketsort) (postscript, PDF)
  • Sorting out Sorting race sequence (MPEG)
  • Macintosh After Dark Sorting Visualization (HQX)
  • Sorting tutorial instructional DOS executable
  • The Complete Collection of Sorting Algorithm Animations (some instructional, some just animate. Primarily written in Java) -- In particular, I recommend the Animator
• Lecture Slides (12/1, graphs) (postscript, PDF)
• Lecture Slides (12/3-12/6, graph traversals, shortest paths) (postscript, PDF)
• Lecture Slides (12/6-12/8, shortest paths, minimum spanning trees) (postscript, PDF)
• Lecture Slides (12/8, wrap-up) (postscript, PDF)
• Final Exam Review Concepts (postscript)
• Course Topics Overview (postscript PDF)