Exercise 5 in Chapter 12 describes a compiler’s symbol table, which keeps track of the program’s identifiers. Write an implementation of a symbol table that uses hashing. Use the hash function b(x) = x mod tableSize and the algorithm that involves Horner’s rule, as described in the section “Hash Functions,” to convert a variable into an integer x. Resolve collisions by using separate chaining. (See the code given on pages 748 to 750 of this chapter. Since you add an item to the table only if it is not already present, does the time required for an insertion increase?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.