Question: Problem 2. We say that a hash function h:UN that maps values from a set U to integers in the range [0M) is n-perfect if

 Problem 2. We say that a hash function h:UN that maps

Problem 2. We say that a hash function h:UN that maps values from a set U to integers in the range [0M) is n-perfect if there exists at most n distinct values u1,,ujU such that h(u1)==h(uj). P2.1. Consider the hash function h(k)=(2k+5)mod11. Is this hash function 2-perfect for the inputs 0,,21 ? Explain why or why not. P2.2. Prove that a hash function h:UN can only be n-perfect if UnM. P2.3. Can a general purpose hash function be n-perfect for any M ? Argue why or why not

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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

Students Have Also Explored These Related Databases Questions!