Computer Science 211
Data Structures

Agenda

• Announcements
• Iterator Lab: wrapup
• Postscript Lab: go over designs in person or by email today
• Stack Implementations
  • List-based
  • comparisons
• Queues
• Queue Implementations
  • List-based
  • Vector-based
  • array-based
• Stack/Queue example: running a maze

Examples

• structure5.StackList
• structure5.Queue
• structure5.AbstractQueue
• structure5.QueueList
• structure5.QueueVector
• structure5.QueueArray
• Text Example: MazeRunner

Lecture Assignment

Due at the start of class, Wednesday, October 28.

Turn in short answers to these questions. Please turn in a hard copy (typeset or handwritten are OK). We will discuss these problems during class, so no late submissions are accepted.

Note: starting with this assignment, the rule that the assignment is due at the start of class will be enforced. Doing the assignment on the fly as we go over it is much less useful to you and unfair to those who took the time to do the assignment as it was intended.

1. Bailey Problem 10.8, p. 246.
2. Bailey Problem 10.10, p. 246.
3. Bailey Problem 10.12, p. 246.