Question

java

Assume that a hash set given the name set is initially empty, the set is implemented using an array of length 13, the hash function is h(x) = x % T (where T is the length of the array), and that quadratic probing is used if there are collisions. Show the state of the array after each operation:

a. set.add(5);

b. set.add(19);

c. set.add(31);

d. set.add(14);

e. set.add(44);

Answer 1

a. set.add(5);

5

b. set.add(19);

5

19

c. set.add(31);

5

19

31

d. set.add(14);

14

5

19

31

e. set.add(44);

14

44

5

19

31