|
Computer Science 211 Data Structures Mount Holyoke College Fall 2009
|
|
Lecture 15: Lists
Date: Monday, October 19, 2009
- Announcements
- Exam recap
- Lab 4 discussion
- Lists
- simple singly-linked
- complexity of public operations
- iterator
- adding a count
- adding a tail pointer
- circular
- complexity of public operations
- iterator
- IntegerGenerator
- SimpleLinkedList
- structure5.SinglyLinkedList
- structure5.CircularList
Due at the start of class, Wednesday, October 21.
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.16, p. 213.