Question

If the last index of a hash table is p−4, where p is a positive integer value, what is the size of the hash table? (NB: Express your answer in terms of p ) Using double hashing, insert the following keys into a hash table of size m=13, using the two hash functions... {337,123,617,93,63,17,37,43,77}. h1=Kmodm h2=8−(kmod8) Using separate chaining insert the keys {22,32,18,19,30,25,42,24,44} into a hash table of size 5 using the hash function h(k)=k mod m

Answer 1

The size of a hash table where the last index is p-4 is p. Double hashing and separate chaining are two methods for resolving collisions in a hash table, using predefined hash functions.

Step-by-step explanation:

If the last index of a hash table is p−4, this implies that the size of the hash table would be p since the last index of an array or table is always one less than its size. Therefore, the size of the hash table is p.When inserting keys using double hashing with a table of size m=13, h1 and h2 are the hash functions defined as h1=K mod m and h2=8−(K mod 8). For each key K, the first hash function determines the initial position, and the second hash function determines the step size for probing in case of collisions.

For separate chaining with keys {22,32,18,19,30,25,42,24,44} and a hash table size of m=5, we use the hash function h(k)=k mod m to insert keys into the hash table. Separate chaining allows multiple keys to be stored in linked lists at each index.The size of the hash table can be determined by using the formula p - 4, where p is a positive integer value. So, if the last index of the hash table is p - 4, the size of the hash table would be p - 4 + 1, since indexing starts from 0. Therefore, the size of the hash table would be p - 3.