CS 3410 Lecture Outline

  1. Graphs (Chapter 10)

  2. Sorting (Chapter 13)

  3. Hashing (Chapter 11)

  4. 2-3, 2-3-4, red-black, B-tree, B*-Trees, B+-Trees, Tries, and Splay Trees(Chapter 9))

  5. AVL Trees (Chapter 9))

  6. Binary Trees (Chapter 9))

  7. Sequential and Binary Search (Chapter 2)

  8. Algorithms (Chapter 6)

  9. Recursion (Chapter 3)

  10. Static,Dynamic,Lists,Stacks, and Queues (Chapters 2,7, and 8)

Last update September 21, 1998.