If currently k=1, the file has two buckets: {bill, mary} and {jane, tony}, and if each bucket can contain at most two records, what happens to k and to the buckets when inserting karl?
Suppose a family of hash functions h k(v)=h(v) mod 2k is used for extendable hashing, and we have the following search key value v and hash function value h(v):
| v | bill | jane | karl | mary | tony |
| h(v) | 00010 | 10111 | 11001 | 00010 | 10101 |
k=2, and the second bucket is split into two: {jane} and {karl,tony}.
You might also like to view...
Which of the following questions would NOT be used by the analyst when determining the human information requirements of a system?
A) What needs to be done to make the system audible, legible, and safe? B) How can the system be made within the approved budget? C) How can the system be made pleasing or even fun to use? D) How can the system support a user's individual work tasks and make them more productive in new ways?
Which architecture provides fault detection?
Manageability Scalability Functionality Performance Efficiency Availability