(Latest Revision: 04/09/2001)
Week 09 Notes for CS 2500, Section 002 -- Spring 2001
CS 2500, Section 002, Tuesday, April 10, 2001
- Look at Upcoming Schedule
- Class starts at 09:40. I take roll at 09:50
- Announcement(s)
- Quiz #2 on thursday -- bring a small blue book
-
- 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
-
CS 2500, Section 002,Thursday, April 12, 2001
- Look at Upcoming Schedule
- Class starts at 09:40. I take roll at 09:50
- Announcement(s)
- Quiz today in the last 50 minutes of class
-
- Discuss some of what is below for 1/2-hour
- Discuss applications of the stack data type
- Evaluating postfix expressions
- "Towers of Hanoi" puzzle program
- depth-first search
- Discuss implementations of the stack data type
- array-based implementation
- pointer-based implementation
- "as-a-list" implementations
- Last 50 minutes of class is quiz #2 -- bring small blue book