19. *Data Structures and Algorithms using Java **I only need the density of this problem with 10 bytes and 200 bytes**

Pseudo keys are in the range 0 to 200,000 and a maximum of 9000 nodes will be stored in a nonperfect hashed data structure. Give the size of the primary storage area array (number of elements) that will produce the optimum loading factor.

9000 nodes will be stored in the structure, n = 9000

n / 0.75 = 12000 first prime above 12000 is 12007. Is 12007 a 4k+3 prime? k = (12007 - 3) / 4 = 3001 YES

Hence Array size is 12007

20. Give the density of the structure described in Exercise 19 assuming the node width is:

a) 10 bytes

b) 200 bytes