Question

Suppose that a hash table contains hash_size = 13 entries indexed from 0 through 12 and that the following keys are to be mapped into the table: 10 100 32 45 58 126 400 (a) Assume that the hash table uses ?key % hash_size? as the hash function and that linear probing is used, present the content of the hash table using the following table. Also answer how many collisions occur when these keys are inserted into the table. (10 pts) (b) Assume that the hash table uses ?key % hash_size? as the hash function and that quadratic probing is used, present the content of the hash table using the following table. Also answer how many collisions occur when these keys are inserted into the table. (10 pts) (c) Assume that the hash table uses ?(sum of all digits of the key) % hash_size? as the hash function and that quadratic probing is used, present the content of the hash table using the following table. Also answer how many collisions occur when these keys are inserted into the table. (10 pts)

          Suppose that a hash table contains hash_size = 13 entries indexed from 0 through 12 and that the
following keys are to be mapped into the table:
10 100 32 45 58 126 400

(a) Assume that the hash table uses ?key % hash_size? as the hash function and that linear probing is used,
present the content of the hash table using the following table. Also answer how many collisions occur
when these keys are inserted into the table. (10 pts)

(b) Assume that the hash table uses ?key % hash_size? as the hash function and that quadratic probing is
used, present the content of the hash table using the following table. Also answer how many collisions
occur when these keys are inserted into the table. (10 pts)

(c) Assume that the hash table uses ?(sum of all digits of the key) % hash_size? as the hash function and
that quadratic probing is used, present the content of the hash table using the following table. Also answer
how many collisions occur when these keys are inserted into the table. (10 pts)

Suppose that a hash table contains hashsize = 13 entries indexed from 0 through 12 and that the
following keys are to be mapped into the table:
10 100 32 45 58 126 400

(a) Assume that the hash table uses ?key % hashsize? as the hash function and that linear probing is used,
present the content of the hash table using the following table. Also answer how many collisions occur
when these keys are inserted into the table. (10 pts)

(b) Assume that the hash table uses ?key % hashsize? as the hash function and that quadratic probing is
used, present the content of the hash table using the following table. Also answer how many collisions
occur when these keys are inserted into the table. (10 pts)

(c) Assume that the hash table uses ?(sum of all digits of the key) % hashsize? as the hash function and
that quadratic probing is used, present the content of the hash table using the following table. Also answer
how many collisions occur when these keys are inserted into the table. (10 pts)

Added by Beth P.

Question

Please give Ace some feedback