CS
3100

Fall 2008

Study Guide

Fall 2008

Study Guide

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 -- Tables and Priority Queues

- Know what the "basic operations" are that "define the ADT
table". Understand what these operations do well enough to
write specifications for them.

- Be aware of the advantages and disadvantages of various
implementations of the ADT table. In particular if I name a table
operation, you should be able to discuss how efficient that operation
can be made in various table implementations.

- Know what the "basic operations" are that "define the ADT
priority queue". Understand what these operations do
well enough to write specifications for them.

- Understand how to implement a priority queue using an ordered
list, binary search tree, or heap. Understand the advantages and
disadvantages of the various implementations.

- 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. Be able to discuss its efficiency in relation to other sorting algorithms we have studied.