Homework Questions

Due - Wednesday, Dec 1, 2004

Chapter 4 - R-4.8,
Write an algorithm for a new stack function which will return the second element from the top of the stack without changing the stack. Your algorithm should call push, pop, and top to access stack elements. (you may not directly refer to the second-to-top element.)
Write an algorithm for a new stack function removeAll. This function takes as input an element, removes all occurrences of that element from the stack, and leaves the remaining elements in their orignal order. For example, assume the original stack was: 10, 45, 6, 77, 6, 6. After the call removeAll(6), the stack will be as follows: 10, 45, 77. You must use push, pop, and top to move elements. You may NOT access elements directly.

Chapter 4 - R-4.2, C-4.4, C-4.10, C-4.12 (don't repeat for a doubly linked list), C-4.15

Chapter 2 - R-2.10, R-2.11
Design (don't implement) a program to play a card game of your choice (such as Poker, BlackJack, or Go Fish). Your design should list a series of classes, the member variables of each class, and the methods of each class. At least one of your classes should be a derived class and you should clearly indicate any methods which are overriden.