Class Lectures

  1. Lecture 0: Class "Rules"5/16/05
  2. Lecture 1: Algorithm Analysis5/16/05 (Edited as of 9:30pm on 5/16)
  3. Lecture 2: Algorithm Analysis5/18/05
  4. Lecture 3: Algorithm Analysis5/18/05
  5. Lecture 4: MCSS Case Study5/23/05
  6. Lecture 5: Java API: Collections5/23/05
  7. Lecture 6: Recursion5/25/05
  8. Lecture 7: More Recursion6/1/05 (Note: reposted as of 9pm 6/1)
  9. Lecture 8: Dynamic Programming6/1/05
  10. Lecture 9: Backtracking6/6/05
  11. Lecture 10: Exam #1 Review6/6/05
  12. Lecture 11: DP Change Algorithm6/13/05
  13. Lecture 12: Merge Sort6/13/05
  14. Lecture 13: Quick Sort6/13/05
  15. Lecture 14: More Sorting6/15/05
  16. Lecture 15: Heap, Heap Sort6/20/05
  17. Lecture 16: Huffman Coding6/22/05
  18. Lecture 17: Trees6/22/05
  19. Lecture 18: 2-4 Trees6/27/05
  20. Lecture 19: More 2-4 Trees6/29/05
  21. Lecture 20: Red-Black Trees7/11/05
  22. Lecture 21: More Red-Black Trees7/13/05
  23. Lecture 22: More Red-Black Trees7/13/05
  24. Lecture 23: Hash Tables7/18/05
  25. Lecture 24: Longest Common Subsequence7/20/05
  26. Lecture 25: Longest Non-Increasing Sequence7/25/05
  27. Lecture 27: Final Exam Review 8/1/05

Reference Lectures