Question: Suppose that each item (record) in a hash table occupies s words of storage (exclusive of the pointer field needed if chaining is used), and
Suppose that each item (record) in a hash table occupies s words of storage (exclusive of the pointer field needed if chaining is used), and suppose that there are n items in the hash table.
a. If the load factor is ? and open addressing is used, determine how many words of storage will be required for the hash table.
b. If chaining is used, then each node will require s + 1 words, including the pointer field. How many words will be used altogether for the n nodes?
c. If the load factor is ? and chaining is used, how many words will be used for the hash table itself? (Recall that with chaining the hash table itself contains only pointers requiring one word each.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
