1. Generate the hash value for primitive types: byte, short, int, char, long, float, double, and string.Compress the hash value into the index: 0-500 2. For the given hash-based map class, implement a Testing class to test this hash-based map a. Store the student's name (key) and ageb. Testing the implemented mapi. Insert, remove, search functionii. Change the load factor to 0.80 and rehashing table size to 4 * original tablesizeiii. How does the map handle collisions?iv. What is the hash function used in a hash-based map class?c. If the hash function is Open Addressing, change it to Separate Chaining. Vice versa.(extra 100 points) Please help me with question C, specifically, which has been boldened. Thank you.
1. Generate the hash value for primitive types: byte, short, int, char, long, float, double, and string.Compress the hash value into the index: 0-500 2. For the given hash-based map class, implement a Testing class to test this hash-based map a. Store the student's name (key) and ageb. Testing the implemented mapi. Insert, remove, search functionii. Change the load factor to 0.80 and rehashing table size to 4 * original tablesizeiii. How does the map handle collisions?iv. What is the hash function used in a hash-based map class?c. If the hash function is Open Addressing, change it to Separate Chaining. Vice versa.(extra 100 points) Please help me with question C, specifically, which has been boldened. Thank you.
Related questions
Question
1. Generate the hash value for primitive types: byte, short, int, char, long, float, double, and string.
Compress the hash value into the index: 0-500
2. For the given hash-based map class, implement a Testing class to test this hash-based map
a. Store the student's name (key) and age
b. Testing the implemented map
i. Insert, remove, search function
ii. Change the load factor to 0.80 and rehashing table size to 4 * original table
size
iii. How does the map handle collisions?
iv. What is the hash function used in a hash-based map class?
c. If the hash function is Open Addressing, change it to Separate Chaining. Vice versa.
(extra 100 points)
Compress the hash value into the index: 0-500
2. For the given hash-based map class, implement a Testing class to test this hash-based map
a. Store the student's name (key) and age
b. Testing the implemented map
i. Insert, remove, search function
ii. Change the load factor to 0.80 and rehashing table size to 4 * original table
size
iii. How does the map handle collisions?
iv. What is the hash function used in a hash-based map class?
c. If the hash function is Open Addressing, change it to Separate Chaining. Vice versa.
(extra 100 points)
Please help me with question C, specifically, which has been boldened. Thank you.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
