Using hash tables of a Map data structure you will write. Write your application by following the steps below: 1. Store char * (name) as key and int (number of courses taken) as value in your map. Let the hash function you use use an algorithm you specify when converting the name into an index. 2. Let the put function add the given name and the number of lessons taken to the map. If the name (key) exists on the map, replace this existing name and the number of courses taken with a new one. That is, only one unique key can be found on the map at a time. 3. The contains function checks whether the key (name) sent to it is on the map. Send 1 if available, 0 otherwise. 4. Let the Get function send the number of lessons learned for the most sent key. If the key is not present in the map, it returns -1. 5. The display function displays all key-value pairs of the map print it. 6. Search for free space linearly in case of collision. Solve the question in C language?
Using hash tables of a Map data structure you will write. Write your application by following the steps below:
1. Store char * (name) as key and int (number of courses taken) as value in your map. Let the hash function you use use an
2. Let the put function add the given name and the number of lessons taken to the map. If the name (key) exists on the map, replace this existing name and the number of courses taken with a new one. That is, only one unique key can be found on the map at a time.
3. The contains function checks whether the key (name) sent to it is on the map. Send 1 if available, 0 otherwise.
4. Let the Get function send the number of lessons learned for the most sent key. If the key is not present in the map, it returns -1.
5. The display function displays all key-value pairs of the map print it.
6. Search for free space linearly in case of collision.
Solve the question in C language?
Step by step
Solved in 2 steps with 1 images
