Question: write it in c language and do all the following stuff : In this project, you will maintain the information of a dictionary using Hashing.
write it in c language and do all the following stuff :
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:Meaning
#Meaning
#Meaning
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
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:
Print hashed tables
including empty spots
Print out table size and the load factor.
Print out the used hash functions.
Insert a new record to hash table
insertion will be done on both hash tables
Search for a specific word
specify which table to search in
Delete a specific word
from both tables
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.
Save hash table back to a file named saved
words.txt
of the
double hashing
Search for a specific word specify which table to search in
Delete a specific word from both tables
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.
Save hash table back to a file named savedwords.txt of the
double hashing
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
