Remember that we will have a 25 point quiz on Wednesday morning.
It will count as part of the in-class category. I expect it to take
15 minutes and be done by about 8:15am. For each question, I will 
give you a drawing of an abstract data type object and you will need
to draw a picture of the implementation of that object as we have
discussed in class.

For the quiz, you are responsible for the queue implemented in an array 
and the stack implemented in the linked list. I expect you to accurately
show all the instance variables and to be able to perform the normal
operations and show the resulting object using that implementation.

I won't ask you to do a sequence on the quiz. 

For practice, I include some abstract objects below. If you wish, you
can draw the pictures and email them to me for comment. If you have a 
digital camera, take a picture of your answer. I'll also post the questions
ad my answers on the course web page tomorrow.

Obviously the quiz will have other objects. But this is more practice.

Sequence (show implementation in array of size 8 and linked list)
beginning
76
12
34
12 < current
9
2
end

Queue (show implementation with array of size 5)
front 12 45 6 23 end
Then remove three items.
Then add 17 25 8
Show implementation again.

Stack (show implementation in a linked list)
top 34 19 75 21
Pop. Pop. Push 47.
Show implementation again.