Hash table

Instructions For this exam you will be implementing a Hash Table with some basic functionality. Your programmust allow the user to Insert, search for delete and output data elements in the hash table. The below represents all possible functionality that could be requested during your exam, though you will only be required to implement a small proper weet of that functionality Requirements General . Each functionality component must be implemented as a separate function, though the function does not need to be declared and defined separately Neobal war are allowed . Newthorised, but they are allowed . Your source must be meded . Where is your UNT Appropriate formative message must be provided for prompts and outputs HT You will be required to implement a la table with one collision strategy and one hashing function except for double hashing which t h ang functions. Your contre must be implemented as a separate function, and should hat an insertar delete ter table sie number of collisions. Your hash function must be implemented as a separate function Your hashtable will need to be of either type it or stringas specified by the version and appropriate constants will be specified The collision strategies are Chaining . Una probing Quadratic probing Double Washing The hashing functions are: Modulashing Mid square base 10 hasting Mid square base 2 hashing Multiplicative String hashing Adler 12 hashing Functionality Youri should have a melowing the to choose between research deine uuting the data c ents in your haha. The should be able to search and outputas many times as they within and they wish there should be notion to end the program tr ied datacements an insert is rejected due to the collision strategy hating the function should put that the wasted Search for the first instance of a user specified data element the desired data cement is found in the last the function should out that the clementi pon finding the f a ce of the element the co w y , the function should output that the element does not exist No error checking is e red Delete the first c lassified data element the desired data clementis found in the hash sable the function should tombstone the data clement's slot in the hash and report that the element was deleted the collision has the function should output that the element does not exist No error checking is required Output al data elements in the hashtable starting at index along with their index in the case of chang, multiple data element may have the same index Instructions For this exam you will be implementing a Hash Table with some basic functionality. Your programmust allow the user to Insert, search for delete and output data elements in the hash table. The below represents all possible functionality that could be requested during your exam, though you will only be required to implement a small proper weet of that functionality Requirements General . Each functionality component must be implemented as a separate function, though the function does not need to be declared and defined separately Neobal war are allowed . Newthorised, but they are allowed . Your source must be meded . Where is your UNT Appropriate formative message must be provided for prompts and outputs HT You will be required to implement a la table with one collision strategy and one hashing function except for double hashing which t h ang functions. Your contre must be implemented as a separate function, and should hat an insertar delete ter table sie number of collisions. Your hash function must be implemented as a separate function Your hashtable will need to be of either type it or stringas specified by the version and appropriate constants will be specified The collision strategies are Chaining . Una probing Quadratic probing Double Washing The hashing functions are: Modulashing Mid square base 10 hasting Mid square base 2 hashing Multiplicative String hashing Adler 12 hashing Functionality Youri should have a melowing the to choose between research deine uuting the data c ents in your haha. The should be able to search and outputas many times as they within and they wish there should be notion to end the program tr ied datacements an insert is rejected due to the collision strategy hating the function should put that the wasted Search for the first instance of a user specified data element the desired data cement is found in the last the function should out that the clementi pon finding the f a ce of the element the co w y , the function should output that the element does not exist No error checking is e red Delete the first c lassified data element the desired data clementis found in the hash sable the function should tombstone the data clement's slot in the hash and report that the element was deleted the collision has the function should output that the element does not exist No error checking is required Output al data elements in the hashtable starting at index along with their index in the case of chang, multiple data element may have the same index