In which method of hashing function, a key is broken into several parts and each part has the same length as that of the required address except the last part?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Which of the following is a hash function?
- In which of the following hashings, the hash functions are describe as h2(key) is not equal to zero and h2 ...
- Which one is keyless partitioning method?
- Which of the following are keyless partitioning methods?
- The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using ...
- The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using ...
- What of the answers below is not an encryption method?
- A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After ...