Week 11 Notes for CS 2500 -- Fall 2000

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • I'm returning the quizzes today, and grades are posted.
  • Sorry, no grades for program #3 yet.
  • FRIDAY, Nov 17, 2000 -- driver module for Program #4.
• Go over some points about the program #4 assignment -- concentrate on things you need to know to get ready for the Friday due date.

• Take Roll.
• Check out this week's schedule
• Announcement(s)
  • Sorry, no grades for program #3 yet -- I am getting closer ...
  • Driver module for program #4 was due Friday, Nov 17, 2000. I'm moving it back to Monday, Nov 20, 2000. Due date for the final version of the program is Friday, Dec 01. That date will not change.
  • Note that there is only a weekend between the final due date for program #4 and the first due date for program #5. You see you must get started on program #5 before the final due date for program #4!
• Discuss implementations of the queue data type
  • array-based implementation
  • pointer-based implementation
  • "as-a-list" implementations
• Discuss pro's and con's of different implementations
  • array-based implementation
    • PRO: simple code
    • PRO: all operations are O(1)
    • CON: static allocation
  • pointer-based implementation
    • PRO: dynamic memory allocation
    • PRO: most operations are O(1)
    • CON: destructor is O(N)
    • CON: extra memory required for each element.
  • "as-a-list" implementations
    • PRO: extremely easy to program
    • PRO: if done a certain way, can be as efficient as coding "from scratch." -- take care to make both insertion and deletion efficient.
    • PRO: can be done with an array-based list or with a pointer-based list.
• If time allows start discussion of binary trees and binary search trees.

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