Note.  Chapters indicated below are for the sixth edition of the textbook. The corresponding chapters in other editions might be different.

Slides

  1. Week 0 (September 7).   Course overview
  2. Weeks 1,2 (September 12, 14, 19, 21).   Algorithm analysis   Chapter 4
  3. Week 3 (September 27, 29).   Analysis of Algorithms, ADT's, Exceptions, Dictionaries   Chapter 4, 2
    Additional notes on exceptions

  4. Week 4 (October 3, 5).  Hash Tables   Chapter 10

  5. Week 5 (October 17, 19).  Hash tables, trees   Chapter 10, 8
  6. Week 6,7 (October 24, 26, 31, November 2).  Trees. Binary Search Trees, Review   Chapter 8, 11
  7. Week 8 (November 7, 9).  AVL trees, multiway search trees    Chapter 11
  8. Week 9 (November 14, 16).  (2,4) Trees, B-Trees   Chapter 11, 15

  9. Week 10 (November 21, 23).  B-trees, Graphs   Chapter 14, 15

  10. Week 11 (November 28, 30).  Graphs   Chapter 14

  11. Week 12 (December 5, 7).  Graphs, Sorting Chapter 14, 12