Hast tables performance evaluation on Turkish dictionary


You will be given a word list containing thousands of Turkish words. You will be asked for finding the number of collisions by entering these words in a dictionary based on hash tables.

Primarily, you must perform an implementation of Dictionary ADT based on hash tables and operating according to linear probing collision resolution rule. Reporting of numbers of total collisions and maximum collisions for 17 different hash functions is expected. 17 different hash functions will be obtained by using cyclic shift hash codes from 0 to 16.

Briefly, you will be asked for simulating the result table for English words (included in page 528 [table 9.2] in the textbook) for Turkish words.

Other information:

  • Default max load factor value 0.5. Initial table size value 100.
  • Division method as compression function.
  • Cyclic shift hash codes as hash code function.
  • Linear probing collision resolution method.
  • Insensitive of lower/uppercase.


The program you will write will import a text file which contains one Turkish word in every line as an input and as for output it will produce a report on the screen formatted as given in Table 9.2.

Note: Do not use instant hash tables data structures; write the descriptions of data structures you will need by yourself.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.