CSci 433: Algorithm & Data Structure Analysis
Spring Semester 1999
Program #3 (Dictionary ADT)
Due Tuesday, 16 March (Revised Date)
Select one of following programming projects
from page 298 of the Goodrich and Tamassia textbook:
P-7.2, P-7.4,
P-7.5, or P-7.6
This exercise calls for you to design and implement a version of the
general Dictionary ADT that uses an ordered sequence, AVL
tree, skip list, or hash table to organize the information internally.
Test your program appropriately and thoroughly with a test driver
program and test data of your own construction.
Please format and document your program source code
appropriately.
When this assignment is complete, submit a paper listing of your
program source code (including the test driver program), any needed
input data files, and output data files. Be sure all items submitted
are clearly labeled with your name and the assignment number.
Also submit your program source code and other files using EASE,
the Electronic Assignment Submission Environment, at URL
http://www.cs.olemiss.edu/submit/.