Week 09 Notes for CS 2500, Section 001 -- Spring 2001

• Look at Upcoming Schedule
• Class starts at 10:10. I take roll at 10:20
• Announcement(s)
• Review the pro's/con's and performance differences between pointer-based and array-based implementations.
• Look at the data structures talk
• Discuss Definition of the stack data type
  • Organization -- Last-In, First-Out
  • Elements -- any given homogeneous set
  • Operations
    • constructor(s)
    • destructor(s)
    • bool StackIsEmpty()
    • void Push(stackItemType NewItem, bool& Success)
    • void Pop(bool& Success)
    • void Pop(stackItemType& StackTop, bool& Success)
    • void GetStackTop(stackItemType& StackTop, bool& Success)
• Discuss applications of the stack data type
  • Evaluating postfix expressions
  • "Towers of Hanoi" puzzle program
  • depth-first search

• Look at Upcoming Schedule
• Class starts at 10:10. I take roll at 10:20
• Announcement(s)
  • Quiz today! -- bring a small blue book

• Look at Upcoming Schedule
• Class starts at 10:10. I take roll at 10:20
• Announcement(s)
  • I will try to post programming assignment #4 on the web soon.
• Discuss applications of the stack data type
  • Evaluating postfix expressions
  • "Towers of Hanoi" puzzle program
  • depth-first search