In this project, you will maintain the information of a dictionary using Hashing. Your program will...

Transcribed Image Text:

In this project, you will maintain the information of a dictionary using Hashing. Your program will read the words and their meanings (synonyms) from a file named words.txt. As well, the user should be able also to enter new words (and their meanings) into the program. Please use the following format for inputs Word:Meaning1 #Meaning2 #Meaning3 Example: good:fine#excellent#great Note that each word will consist of max of three synonyms only. You will have to create a hash table to store the words and use words as the keys. You should implement hashing in two different methods to resolve collisions using open-addressing and double hashing and generate 2 different hash tables each using the different methods. The following options should be available for the user. For each option, you should provide the related information for both hash tables you have created: 1. Print hashed tables (including empty spots). 2. Print out table size and the load factor. 3. Print out the used hash functions. 4. Insert a new record to hash table (insertion will be done on both hash tables). 5. Search for a specific word (specify which table to search in). 6. Delete a specific word (from both tables). 7. Compare between the two methods in terms of number of collisions occurred. Here you have to print the number of collisions occurred (if happened) once every new word is inserted. 8. Save hash table back to a file named saved_words.txt (of the double hashing) In this project, you will maintain the information of a dictionary using Hashing. Your program will read the words and their meanings (synonyms) from a file named words.txt. As well, the user should be able also to enter new words (and their meanings) into the program. Please use the following format for inputs Word:Meaning1 #Meaning2 #Meaning3 Example: good:fine#excellent#great Note that each word will consist of max of three synonyms only. You will have to create a hash table to store the words and use words as the keys. You should implement hashing in two different methods to resolve collisions using open-addressing and double hashing and generate 2 different hash tables each using the different methods. The following options should be available for the user. For each option, you should provide the related information for both hash tables you have created: 1. Print hashed tables (including empty spots). 2. Print out table size and the load factor. 3. Print out the used hash functions. 4. Insert a new record to hash table (insertion will be done on both hash tables). 5. Search for a specific word (specify which table to search in). 6. Delete a specific word (from both tables). 7. Compare between the two methods in terms of number of collisions occurred. Here you have to print the number of collisions occurred (if happened) once every new word is inserted. 8. Save hash table back to a file named saved_words.txt (of the double hashing)

Answer rating: 100% (QA)

Youve shared an image that outlines the specifications for a project involving the creation and maintenance of a dictionary using Hashing techniques I... View the full answer