Suppose you are told to implement a open hash table that has at most 12,000 buckets and you expect to use up at most a half of that. What is the average number of attempts you expect to experience for any particular query? Round to the nearest 2 decimal places if necessary.

A hash table with non-negative integer keys has a modulo hash function of key % 15. Hash function index range: 0 to Ex: 5 Item 110 will go in bucket Ex: 26

Suppose the length of a hash table is 14, and the hash function is h(key)=key%11. There are only four nodes in the table: H(15)=4, H(38)=5, H(61)=6, H(84)=7, and the remaining positions are empty. If the conflict is handled by the linear detection method, what is the node address of 49? 8. 3 9. None of the above

Show what the array of the HashMap would look like after all the items below have been added, assuming the HashMap class uses linear probing to resolve collisions. Assume the array is resized when the current item to be added will make the total number of items greater than or equal to the threshold value. Note that for both questions, you do not need to compute the hashcodes, since I have provided them for you. Therefore, you only need to carry out Step 2, which is translating the hashcodes to valid array indexes. Assume remainder division is used to accomplish this. The challenge of this assignment is to correctly handle all collisions that may result when translating the larger range of hascode values into the smaller range of valid array indexes. For this assignment you will not need to resize the array or re-hash items.

Is it possible to "decrypt" a hash of a message in order to obtain the original message? Give an explanation for your answer.

Rehash the hash table below (separate chaining, length 5) to a new length of 10. Draw the new hash table after rehashing, Assume that hashCode (x) = x for this question. Assume that we always traverse a chain from head to tail and always insert at the head of the chain example 0:15->30 1:6->21->11 2: 3: A 4:-14

you can search a hashtable either by the keys , or by the assiocated values. True or false ?

Use linear probing to place the following values in the hash table. H(key) = key % 6 Values: 13, 21, 7,8 1 4 2. 3.

How many linked lists are there in a hash table of size m? What is a hash function used for? Use example.