3. Given a hash table with size 7, a hash function hash (x) = x %...

  

Transcribed Image Text:

3. Given a hash table with size 7, a hash function hash (x) = x % 7, and keys 5, 7, 14, 1, 19, 21. (a) (5 points) Hash the keys using chaining to resolve collisions. Show your work. (b) (5 points) Hash the keys using linear probing to resolve collisions. Show your work. (c) (5 points) Hash the keys using quadratic probing to resolve collisions. Show your work. (d) (5 points) Hash the keys using double hashing to resolve collisions. Suppose the second hash function hash' (x) = 3 - (x % 3). Show your work. (e) (3 points) What is the load factor after the keys are hashed? 3. Given a hash table with size 7, a hash function hash (x) = x % 7, and keys 5, 7, 14, 1, 19, 21. (a) (5 points) Hash the keys using chaining to resolve collisions. Show your work. (b) (5 points) Hash the keys using linear probing to resolve collisions. Show your work. (c) (5 points) Hash the keys using quadratic probing to resolve collisions. Show your work. (d) (5 points) Hash the keys using double hashing to resolve collisions. Suppose the second hash function hash' (x) = 3 - (x % 3). Show your work. (e) (3 points) What is the load factor after the keys are hashed?

Answer rating: 100% (QA)

a Hashing the keys using chaining to resolve collisions Hash function hashx x 7 Key 5 Hash value hash5 5 7 5 Insert 5 at index 5 5 Key 7 Hash value hash7 7 7 0 Insert 7 at index 0 7 5 Key 14 Hash valu... View the full answer