Given a known set of keys, a perfect hash function is one that translates every key to adifferent bucket index. For example, given the set of keys {'alpha', 'beta', 'gamma', 'delta’},the following is a perfect hash function:m = 4; hash(k) = (initial letter of k - 'a') modulo 4a. Under what circumstances does it make sense to seek a perfect hash function? Explain.b. How can a perfect hash function be exploited in implementing a hash table? Explain.c. Given the following set of keys:{CA, MX, US}find a perfect hash function with m = 3,d. Given the following set of keys:{AT, BE, DE, DK, ES, FI, FR, GR, IE, IT, LU, NL, PT, SE, UK}find a perfect hash function with m < 20. 5. Given a known set of keys, a perfect hash function is one that translates every key to adifferent bucket index. For example, given the set of keys {'alpha', 'beta', 'gamma', 'delta’},the following is a perfect hash function:m = 4; hash(k) = (initial letter of k - 'a') modulo 4a. Under what circumstances does it make sense to seek a perfect hash function? Explain.b. How can a perfect hash function be exploited in implementing a hash table? Explain.c. Given the following set of keys:{CA, MX, US}find a perfect hash function with m = 3,d. Given the following set of keys:{AT, BE, DE, DK, ES, FI, FR, GR, IE, IT, LU, NL, PT, SE, UK}find a perfect hash function with m<20.

The perfect hash function is best in situations where there is a large frequently asked set, S,…

Answered: 5. Given a known set of keys, a perfect…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Given a known set of keys, a perfect hash function is one that translates every key to a
different bucket index. For example, given the set of keys {'alpha', 'beta', 'gamma', 'delta’},
the following is a perfect hash function:
m = 4; hash(k) = (initial letter of k - 'a') modulo 4
a. Under what circumstances does it make sense to seek a perfect hash function? Explain.
b. How can a perfect hash function be exploited in implementing a hash table? Explain.
c. Given the following set of keys:
{CA, MX, US}
find a perfect hash function with m = 3,
d. Given the following set of keys:
{AT, BE, DE, DK, ES, FI, FR, GR, IE, IT, LU, NL, PT, SE, UK}
find a perfect hash function with m < 20.