COP 3530C - Summer 2002 - LECTURE NOTES PAGE

  • Skip Lists - (5/13)

  • Self-Organizing Lists - (5/15)

  • Sparse Matrices - (5/20)

  • BSTs, Balancing Trees, and AVL Trees - (5/22)

  • Rotations Explained

    •
  • Red-Black Trees - (6/3)

  • Splay Trees - (6/5)

  • Multi-way Trees - (6/10)

  • Red-Black Trees Revisited - (6/12)

  • Red-Black Trees Again!! - (6/13)

  • Mid-term Exam - 6/17 Exam Key

  • 2-4 Trees - (6/19)

  • The Family of B-Trees - (6/24)

  • Hashing - (6/26)

  • Dynamic Hashing - (7/1)

  • R-Trees - (7/3)

  • Parallel Algorithms I - (7/8)

  • Parallel Algorithms II - (7/10)

  • Parallel Algorithms III - (7/15)

  • Parallel Algorithms IV - (7/17)

  • The Future of Computing? - (7/22)

  • Wednesday July 24th - Wrap things up - discuss Homework #2

  • FINAL EXAM - Monday July 29th 10:00AM

    • Last updated: 7/22/02
    Return to COP 3530C home page