Question: Hashing Consider a hash table of size T = 10 with the hash function, h(key), given below. You are to insert following values: 12, 26, 48, 96, 93, 15, 32 h/key) – floor(T*(mod(key*A,1))) where A = 0.61803398874 a) Draw the hash table when collisions are handled by linear probing, b) Draw the hash table when collisions are handled by separate chaining, c) What is the worst-case time complexity in (a) if we are to search for a key? d) What is the load factor of this table after inserting all elements? e) If we are to use keys of string type, propose a hashing strategy that could reduce the amount of collisions but uses the same hash function given above. What is the hash value for string “analysis” If we are to use the hash strategy proposed in (e)? (1 am asking what is the output of h(“analysis”). You must show step by step calculations) Show transcribed image text Question: Hashing Consider a hash table of size T = 10 with the hash function, h(key), given below. You are to insert following values: 12, 26, 48, 96, 93, 15, 32 h/key) – floor(T*(mod(key*A,1))) where A = 0.61803398874 a) Draw the hash table when collisions are handled by linear probing, b) Draw the hash table when collisions are handled by separate chaining, c) What is the worst-case time complexity in (a) if we are to search for a key? d) What is the load factor of this table after inserting all elements? e) If we are to use keys of string type, propose a hashing strategy that could reduce the amount of collisions but uses the same hash function given above. What is the hash value for string “analysis” If we are to use the hash strategy proposed in (e)? (1 am asking what is the output of h(“analysis”). You must show step by step calculations)

## Expert Answer

Answer to Question: Hashing Consider a hash table of size T = 10 with the hash function, h(key), given below. You are to insert fo…