As part of your review process, I recommend you study:
- Notes from class
- Reread book chapter
- Lab assignments
- Look over exercises at the end of the chapter in the book.
Chapter Eleven : Heaps and
- Know how to define a heap. Know how to implement a heap with the
array implementation described in the text. Understand how insertion
and deletion are performed in this implementation.
- Know how heapsort works -- how it transforms a randomly ordered
array into a heap, and how it then uses the heap deletion operation to
sort the array.
Chapter Twelve: Advanced
Implementations of Tables
- Be able to define 2-3 tree.
- Know how to conduct a search by key in a 2-3 tree.
- If I give you a sketch of a 2-3 tree and tell you to insert
and/or delete some keys, you should be able to accurately sketch how
the tree will look after each operation is carried out.
- Know the definition of hashing.
- Know what a hash function is.
- Understand the need for collision resolution. Know the
definitions of open addressing and separate chaining and understand how
to implement these forms of collision resolution.