- Execute the "calc_hash" function shown in the "hash search example" below with multiple inputs on a PC and display the results (hash values). - It can also be executed by simply adding the main function: int main() { printf("%d\n", calc_hash ("computer")); printf("%d\n", calc_hash ("California")); return 0; } - TAB_SIZE must be defined appropriately. "hash search example" Table tab [TAB SIZE]; int calc_hash (char* name) { int i, hash_val; hash_val = 0; while (*name!= 0) hash_val += *name++; } return hash_val % TAB_SIZE; Table* lookup tab(char* name) { Table* pe; for (pe = tab[calc_hash (name)]; pe!= NULL; pe = pe->next){ if (strcmp(pe->name, name) = = 0) return pe; } return NULL; }

1. Write a get hash() function, which returns the index in the hash table. The hash function is calculated as follows: h(key) is calculated as the remainder after (key +7) is divided by the size of hash table The function header is as follows which has two parameters: key and size of hash table def get hash(key, size):

2) Hash Innards Homework • Unanswered Select all true statements from the below. Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation. SHOW MORE V a A hash function takes a key and produces an index into the hash table. The next step in this process is often something like 'h%SIZE' so that the hash value of the key will fit within the table b (having SIZE elements, you see). Common techniques involve exclusive or of bits within the key and folding different sections of bits within the key into each other. The best hash method for character strings is to simply add up the ASCIlI values of their individual characters. Coming up with a perfect hash for a given set of keys can be a difficult and time-consuming task.

Use C++ Programming language.   The header file below defines a class for a simple hash table:  hashMap.h Download hashMap.h Write a driver program to test the class with the following data:     (520, "3100 Main St, Houston TX ");     (37, "2200 Hayes Rd, Austin TX");     (226, "1775 West Airport St, San Antonio TX");     (273, "3322 Walnut Bend, Houston TX");     (491, "5778 Alabama, Waco TX");     (94, "3333 New St, Paris TX"); Make sure to test the find function for exiting and non-existing data 2. Modify the type of member key in class HashEntry from int to a string (this is useful is the key is e.g. the phone number or e-mail address). Use the string hash function discussed in class (see ppt notes) or search online for alternative functions that work on strings. 3. Modify the collision strategy of class HashMap to do separate chaining instead of linear probing.  Be sure to modify the display function so that items in the bucket chains are also displayed in a pre-defined order…