1) Build a hash table with overflow chaining ,using the data a dictionary file .You may use either list or tree overflow. 2) Look up the wanted words and report on the performance of the program ,especially the average number of comparisons per successful search and per unsuccessful search(to 2d.p). 3)Create a table of results [with 4 columns, one that says Successful, Unsuccessful and Overall, another one that says [login to view URL] words, anther one that says No. of comparisons required and another one that says Average no. of comparisons per word.] and comment (a few sentences)on any changes in performance using hashing over binary trees. 4) Delete the words from [login to view URL] and repeat step 2. 5) Repeat steps 1, 2 using at least 3 different hash functions and 3 different table sizes. One of the hash functions and one of the table sizes should be selected to produce poor performance. Report on the resulting performance of the 9 combinations. 6) Build a hash table using open addressing and repeat all steps up to and including 5. 7) Modify your program to include Brent’s algorithm and repeat the statistics part of the assignment.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
## Platform
In all systems...