Week 12 Notes for CS 3100 -- Fall 2000

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Final version of program #4 due today
  • Program #5 assignment is out -- hashing program
  • Reading assignment for chapter 12 has changed a little -- read about hashing first.
• Discussion of chapter 11 material -- tables, heaps, and priority queues.
  • Table as ADT (pp. 518-519)
  • Compare implementations: array-based list, pointer-based list, binary search tree.
  • Priority Queue as ADT (pp. 536-537)
  • Compare implementations: array-based list, pointer-based list, binary search tree, heap.
  • Heapsort
• Discussion of hashing
  • What is the problem we want to solve with hashing?
  • What is the ADT hash table?

• Take Roll.
• Check out this week's schedule
• Announcement(s)

• NO CLASS TODAY -- Thanksgiving Vacation