DICTIONARY ADT COMPARISON
In this assignment redo the word-concordance program (Homework #4), but timing it using:
BST-based dictionary implementation, and also
AVL-based dictionary implementation
to store both the stop-words and the word-concordance information.
Time your word-concordance application from homework #4 using both tree-based dictionary ADT
implementations to complete the following table:
Dictionaries implemented using AVL trees
Dictionaries implemented using BSTs
Word-concordance Program Execution Time (seconds)Word-concordance Program
DATA FILES - Download hw6.zip file at http://www.cs.uni.edu/~fienup/cs1520s13/homework/ it contains:
the stop words in the file stop_words.txt
the data file to be processed by your word-concordance program in the file hw4data.txt (same as hw4)
You will also need:
your BST implementation from lab9
your AVL implementation from lab10
EXTRA CREDIT POSSIBILITIES:
1) Implement a ClosedAddrAVLTreeDict dictionary ADT by modifying the ChainingDict dictionary ADT. The
ClosedAddrAVLTreeDict implementation should use a AVL tree at each hash table slot instead of an unsorted
linked list.
SUBMISSION
Submit ALL necessary files to run your concordance-production application using the dictionary ADTs as a single
zipped file (called hw6.zip) electronically at
https://www.cs.uni.edu/~schafer/submit/which_course.cgi
Include in your hw6.zip file a "results" file (hw6.doc, .txt,.rtf, .odt, etc.) containing the completed table above, i.e.,
timing results for your word-concordance programming using the various dictionary ADTs.
Data Structures (CS 1520) Homework #6
Docsity.com