Question

2. In this first question you will apply the specified operations to instances of LinearHashTable (i.e., hash tables that use the "linear probing" approach as it was discussed in class). When such a hash table is first created, it has dimension 1 and an initial length of 2, and subsequent operations might require that the underlying array be resized, so for each of the questions below, start with the hash table specified and demonstrate (by drawing the underlying array) what the hash table looks like after each operation. Since you will only be inserting integer values into these hash tables, the hash function you will use for this question is simply: hash(x) = x % 2dimension where the length of the hash table is 2dimension. To clarify, if the hash table is of length 8, the dimension is 3, so if you apply the hash function to some number, you obtain the result by long dividing that number by 8, keeping only the remainder and discarding the quotient. Be sure to enter the proper number of entries separated by spaces. For example, a dimension 2 hash table has 4 locations. Thus I would enter exactly 4 values separated by spaces. For example: N N 100 200 if my hashtable was storing null in index 0 and 1 and 100 in index 2 and 200 in index 3. a) Starting from an empty hash table (of dimension 1), perform the specified insertion operations. Write null values as N. The first one is done for you. If you resize the table, be sure to provide the correct number of N values and in the proper order. add (39) N 39 add (63) add (15) add (47)
Linear Hash Table

Answer 1

h(x) = x%29 add (39) Ñ 39 add (63) 63%. 2 = 1; collision Apply linear probing, key maps to index=0 163|39 add (15) - Resize dimension=2 h(x) = 157. 2 - 15 %. 4 = 3 add (47); n(49) - 49 %. 4 = 1 Apply breal probing key maped to index=2 2

@ www/44 | 6 | 30 | M o 2 3 4 5 6 7 remove (61): key is 61/8 = 5 removed from location 5 IN N N N 44 N 30 NL add (84): 844.8= 4 (collision) key is mapped to location 5. remove (30): 30-7.8=6; key is removed from location 6. 0 1 2 3 4 5 6 7 add (3+): 0 31.1.8=5 {collision] key is maped to location 6 0 1 2 3 4 5 6 7