CS III Homework #5 Due: Tuesday, April 8, 2008 (5 PM)

For this assignment, you are to re-implement homework #4 three ways:

1) implement the dictionary ADT using the same hash table as HW #4, except each slot contains a BST instead of an OrderedList.

2) implement the dictionary ADT using a binary search tree (the BST from lab 8 would be okay), and

3) implement the dictionary ADT using an AVL tree (the AVL tree from lab 9 would be okay),

NOTE: If you had trouble implementing some aspect of HW #4, I suggest that you start with my solution to HW #4 as the starting point for HW #5. It will be available after 3 PM on Monday, March 31 at:

http://www.cs.uni.edu/~fienup/cs063s08/homework/hw4_solution.zip

After you complete your three additional implementations, complete the following timings using your programs and the same data files as homework #4:

Program Stop Words

Hash Table Size

Concordance

Hash Table Size

Execution Time

(seconds)

Original HW #4 with OrderedLists in slots 3,000 200  
HW #5 with BSTs in slots 3,000 200  
Original HW #4 with OrderedLists in slots 1,500 100  
HW #5 with BSTs in slots 1,500 100  
Original HW #4 with OrderedLists in slots 750 50  
HW #5 with BSTs in slots 750 50  
Original HW #4 with OrderedLists in slots 375 25  
HW #5 with BSTs in slots 375 25  
HW #5 with single BST - -  
HW #5 with single AVL tree - -  

DATA FILES (these are the same as hw #4)

The stop words are in the file

http://www.cs.uni.edu/~fienup/cs063s08/homework/stop_words.txt

The textual information to be examined is in the file

http://www.cs.uni.edu/~fienup/cs063s08/homework/hw4data.txt

SUBMISSION

You are to electronically submit and turn in hardcopy printouts of: