|
Computer Science 211 Data Structures Mount Holyoke College Fall 2009
|
|
Lecture 16: Lists Wrapup; Stacks
Date: Wednesday, October 21, 2009
- Announcements
- We will meet for Friday's 4th Hour in our regular classroom
to make sure you have everything you need to be able to do the
next lab. If there is time, we will move up to Kendade 307 for
you to get started.
- Lecture Assignment Recap
- Doubly-Linked Lists
- complexity of public operations
- Design of Lists and related classes
- Vectors as lists
- Stack Intro
- Lab 5 Out
- structure5.DoublyLinkedList
- structure5.List
- structure5.Structure
- structure5.AbstractList
- structure5.Stack
Due at the start of class, Friday, October 23.
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.
- Bailey Problem 9.4, p. 212 (in the "Problems" section at the bottom, not the "Self Check Problem")
- Bailey Problem 9.10, p. 213.