Problem 70

This is the archived version of this course from the Spring 2013 semester. You might find something more recent by visitning my teaching page.

# 2-choice hashing example

Due: April 5
Points: 2

Use the following two very simple hash functions:

$h_1(x) = x \bmod 10$ $h_2(x) = \left\lfloor\frac{x}{10}\right\rfloor$

to insert the following sequence of keys:

$$[97, 67, 60, 70, 13, 32, 87, 3, 58, 43]$$

into a hash table of size 10.