CSC111HashActivity 2 .pdf - CSC 111 – Data Structures and...

CSC 111 – Data Structures and Abstraction
Spring 2022 – Uche
Hash Activity – Thursday, May 5
Learning Objectives
 Construct a hash table using separate chaining and linear probing collision policies
 Update hash tables after deletion and insertion operations
 Compute search performance for separate chaining and linear probing collision policies
Assume an 11-item hash table using the hash function
h(i) = (2i + 5) mod 11
for the following key values in order
12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 .
1. Construct a hash table using the following collision policies.
a. Separate chaining
b. Linear probing
2. For each table, show the state of the table after performing the following operations in order:
Delete 88, 11, 39
Insert 66, 3
3. What is the performance as measured by comparisons for the following searches for each