C++ Help

"A C++ compiler uses a symbol table to keep track of the identifiers that a program uses. When the compiler encounters an identifier, it searches the symbol table to see whether that identifier has already been encountered. If the identifier is new, it is added to the table. Thus, the symbol table needs only addition and retrieval operations. Implement the HashedDirectory class provided in the source code which uses separate chaining to resolve collisions. Use the hash function h(x) = x mod tableSize and the algorithm that involves Horners rule, as described in Section 18.4.1 about hash functions, to convert a variable into an integer x. Because you add an entry to the dictionary only if its search key is not already present, does the time required for an addition increase?

********************************************************************************

Project Source Code:

Link : https://drive.google.com/file/d/1NwkHr2GrUklmgWrqTpAs0Yuzb8isER8e/view?usp=sharing

********************************************************************************