Question: A large number of deletions in a separate chaining hash table can cause the table to be fairly empty, which wastes space. In this case,

A large number of deletions in a separate chaining hash table can cause the table to be fairly empty, which wastes space. In this case, we can rehash to a table half as large. Assume that we rehash to a larger table when there are twice as many elements as the table size. How empty should the table be before we rehash to a smaller table?

Step by Step Solution

3.50 Rating (187 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

We must be careful not to rehash too often Let p be the threshold fraction of table s... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

1486-C-S-A(371).docx

120 KBs Word File

Students Have Also Explored These Related Algorithms Questions!