Computer Science 261
Third Exam Review
Disclaimer: I have attempted to be comprehensive in the
following, but important items may have been omitted by mistake. If
you see such an omission, please let me know, but you are responsible
for all of the lecture material to date. (this is a draft - I may
have more to add in class Tuesday).
(changes discussed in lecture 11/2/99 are in bold)
The third hour exam in CSci 261 will be given on Friday, Nov. 5,
and will cover Chapters 4 (lists, stacks, and queues) and Chapter 5
(excluding sections 5.4 (Huffman Coding Trees) and 5.6 (Heaps and
Priority Queues)). Some details:
- Linked Structures:
- Be able to make a copy of a linked structure (list or
tree)
- Be able to determine equality of two linked structures (lists
or trees)
- Trees and graphs
- Be able to give definitions of graphs, trees, connected
graphs, cycles.
- For trees, be able to define sibling, parent, child, ancestor,
descendant, root, leaf, subtreee.
- Be able to write a routine to calculate the depth of a tree;
to calculate the number of nodes in a tree (or the length of a
list).
- Be able to describe and program inorder, preorder, and
postorder traversals
- Binary Search Trees
- Be able to create, destroy, insert, delete, list, and search
in a binary search tree (the work we've been doing the past
week)
- Be able to name the integrity constraint which makes a binary
search tree work.