Question: Exercise (HashTables managing a dictionary) Create a small GUI program using javax.swing components. This is just a dummy UI with no search capabilites in this
Exercise (HashTables managing a dictionary)
Create a small GUI program using javax.swing components. This is just a dummy UI with no
search capabilites in this Part 1.

Part 2: Find an API to downlown the database of English words, their type (noun, verb) and their
meaning; create a word object store that information into an an AVL tree.
Note: Your java program above should have the ability to utilize the API and download the information
no manual steps, unless the scope changes.
Part 3: Create an efficient hash function to convert each word into an int Key:
Part 4: Implement Linear Probing, Quadtratic Probing, Separate Chaining, Double Hashing techniques
discussed in class. Chose an appropriate Lamda value per implementation. Utilize the AVL tree to
retreive the object and store into the hash table along with the Key.
Part 5: Once a word is searched, output its meaning and provide the information related to each specific
implementation in the ouput. For example:
CS 3345: Data Structures and Algorithms Exercise (HashTables-managing a dictionary)- all parts are due on 10/3 at 11:30pm Part 1: Create a small GUI program using javax.swing components. This is just a dummy UI with no search capabilites in this Part 1 Word to search for Data Structure Search WordNet Noun data structure ((computer science) the organization of data (and its storage allocations in a computer) Part 2: Find an API to downlown the database of English words, their type (noun, verb) and their meaning; create a word object store that information into an an AVL tree Note: Your java program above should have the ability to utilize the API and download the information no manual steps, unless the scope changes. Part 3: Create an efficient hash function to convert each word into an int Key: hash function Part 4: Implement Linear Probing, Quadtratic Probing, Separate Chaining, Double Hashing techniques discussed in class. Chose an appropriate Lamda value per implementation. Utilize the AVL tree to retreive the object and store into the hash table along with the Key Part 5: Once a word is searched, output its meaning and provide the information related to each specific implementation in the ouput. For example Word to search for Data Structure Search WordNet Noun data structure ((computer science) the organization of data (and its storage allocations in a computer) Total Words: XXXXXXX Data Structure Linear Probing Quadratic Probing Xxx Separate Chaining XXX Double Hashing: Table Size ambda Items investigated Success Yes or No Yes or No Yes or No Yes or No xxX xXX
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
