Writ.e a program that will use the hash function "H (key) =key mod 20" to create bank application that stores the below information of customer in the hash table of size =20. Account Number (Key) must be 4 digits value and generated by user defined random function .Compare its performance with linear probing, quadratic probing. If you use "cubic probing"; here the ith probe is at hash(x) + i3. Does cubic probing improve the performance over linear probing and quadratic probing?

•  key
•  name
•  account title
•  balance
•  status
Programming language should be JAVA. Please make this program also provide output to make sure, code is working.

Answer rating: 100% (QA)

Note If hash table size is small than there is no significant improvement in performance But if hash table size is greater say 2000 then time taken ar... View the full answer