How many empty lists do you expect to see when you insert N keys into a hash table with SeparateChainingHashST, for N=10, 102, 103, 104, 105, and 106? Hint: See exercise2.5.31.
Exercise 2.5.31:
Distinct values.Write a client that takes integers M, N, and Tas command-line arguments, then uses the code given in the text to perform Ttrials of the following experiment: Generate N random int values between 0 and M-1 and count the number of distinct values. Run your program for T = 10 and N= 103, 104, 105, and 106, with M= N/2, and N, and 2N. Probability theory says that the number of distinct values should be about M(1-e-α) where α = N/M—print a table to help you confirm that your experiments validate that formula.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.