The Java hash function for Strings generates a hash code depending on the string's maximum length. Given that Strings have no meaningful upper constraint on length, describe how to build an efficient, constant-time hashing method. (Hint: Which of the following eight characters would you use to represent a string of length l?)

The Java hash function for Strings computes a hash code based on a fixed maximum number of characters of the string. Given that Strings have no meaningful upper bound in length, describe how an effective, constant-time hashing algorithm can be constructed. (Hint: If you were to pick, say, eight characters to represent a string of length l, which would you choose?)

,Write a program to implement hashcode and equals.

write code for :

Use python

Suppose you have an object made up of two w-bit integers, x and y. Show why x+y does not make a good hash code for your object. Give an example of a large set of objects that would all have the same hash code. c++ and provide good comments.

Given two arrays of integers, write a function to find the intersection of the arrays. The intersection should include only distinct elements and the result should be in sorted order. Solve this problem using the hash set approach.

). This problem is about the chaining method we discussed in the class. Problem 3 (, Consider a hash table of size N = 11. Suppose that you insert the following sequence of keys to an initially empty hash table. Show, step by step, the content of the hash table. Sequence of keys to be inserted:

- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it form the table. Themethod returns true, if the deletion is successful and false otherwise.(vi)…

Use Python to program a hash with a couple of people and their interconnected birth years. Next, show the people's names and their birth years, and have the user enter one. Reverse the hash and show the birth years, having the user choose a birth year. Then, show the person's name for that birth year. Also, the user should have the option to add and delete entries.