Week 10 Notes for CS 3100 -- Spring 2003

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Level 2.5 of Derivative Program (#4) due Friday
• 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
• Discuss Program #4 -- Derivatives