Computer Science 261
Exam 4 Review
The fourth hour exam will be given on Friday, Nov. 30, and will cover chapters
8- 13 (skipping chapter 11) of Budd together with class
notes and additional material on objects and the built-in data objects in Java
(O'Reilly textbook and Java2.ppt in the handouts folder). There may be a
question on QuickSort as well.
Usual caveats apply.
- Be able to work with objects, and to use and over-ride the built-in
toString and equals methods of the Object class. Be comfortable with
the material in Java2.ppt (in the handouts folder). Know the
difference between extends and implements.
- Be able to use the built-in Vector, ArrayList, and LinkedList classes and
the methods illustrated in VectorExamples.java (in the handouts folder)
- Be able to describe the Stack and Queue data structures, and to implement
them using arrays, linked lists, and the built-in Vector, ArrayList, and
LinkedList classes.
- Be able to use stacks and queues.
- Be able to describe a stack frame and say how it is used.
- Be able to write the code for quicksort (including the pivot
function). How can we say (informally) that quicksort is O(n*log(n))?
- Be able to define a graph (network) and a tree. For trees, be able
to define and identify root, subtree, leaf, children, parent, siblings
ancestor, descendent (did I leave anything out?).
- Be able to give inorder, preorder, and postorder traversals of binary
trees, and to recover the binary tree from an inorder an either a preorder
or a postorder traversal (Tuesday's lecture).
- Iterators will not be on this exam, but will probably be on the final
Any questions? Please ask!