Class Lectures

  1. Lecture 1: Algorithm Analysis(1/6)
  2. Lecture 2: Algorithm Analysis(1/8)
  3. Lecture 3: Algorithm Analysis(1/13)
  4. Lecture 4: MCSS Case Study(1/15)
  5. Lecture 5: Stacks and Queues: Array Implementations(1/22)
  6. Lecture 6: Linked Lists(1/27)
  7. Lecture 7: More Linked Lists(1/29)
  8. Lecture 8: Binary Trees(2/3)
  9. Lecture 9: More Binary Trees(2/5)
  10. Lecture 10: Exam #1 Review(2/10)
  11. Lecture 11: Recursion(2/17)
  12. Lecture 12: Merge Sort(2/19)
  13. Lecture 13: Quick Sort(2/24)
  14. Lecture 14: More Sorting(2/26)
  15. Lecture 15: Heap Sort(3/3)
  16. Lecture 17: Exam #2 Review(3/10)
  17. Lecture 18: Hash Tables(3/24)
  18. Lecture 19: AVL Trees(3/26)
  19. Lecture 20: AVL Trees(3/31)
  20. Lecture 21: Huffman Coding(4/2)
  21. Lecture 22: String Matching(4/7)
  22. Lecture 23: Dynamic Programming(4/9)
  23. Lecture 24: Floyd Warshall's Algorithm(4/14)
  24. Lecture 25: More Dynamic Programming(4/16) (Note: Edited as of 6:30 pm Wednesday 4/16/03.)
  25. Lecture 26: Final Exam Review(4/21)