Write some Software

Continue the Lab 5 (Hash Map). The instructor and GA will help you. The following is Lab 5. -------- Today’s goal is to implement a Hash Map in C/C++. Write the functions “add(…)”, “getvalues(…)”, and “deallocate(…)”, which add a new data to the hash map, return a value of a key, and de-allocate all memory space of the hash map, respectively. You can decide the parameter lists of the functions. We are supposed to handle student data, which has CWID (8 digits), name, contact number, and major. An example code of the student structure is: struct Node { unsigned int CWID; // you can use a string type for CWID too. string Name; string ContactNumber; string Major; struct Node *pNext; }; For getvalues(…) function, you can subdivide the function into smaller, e.g., getName(key), getContactNumber(key), and getMajor(key), since there are multiple values of the key. Or, getvalues(…) may return a student structure. It’s up to you. You may want to use a class (encouraged but not required). You can use any constant parameters for Hash table size, and algorithm for Hash function. The main function should look like following: int main(void) { // declaration of hash map or declare some variables for hash map … // Add student data records that you want. (at least 5 data) // for example, // add(50000001, “Tom”, “900-000-0000”, “Computer Science”); // add(50000002, “Alex”, “900-000-1234”, “Software”); … // Display all data // For example, cout << getName(50000001) << getContactNumber(50000001)… … // deallocate all memory space deallocate(…); return 0; } Enjoy programming!!! Don’t forget submitting your source code to eCollege.