Helsinki University of Technology
Laboratory of Information Processing Science
Tik-76.122 Data Structures and Algorithms
demo

Assignment 6 (4 points)

Give the contents of the hash table when the given items are inserted in that order in an initially empty table of size 17 using double hashing. Use the following hash functions:

h(k) = (k + 1) mod 17

h2(k) = 8 - (k mod 8)

Use the following coding for the alphabet:

	A = 1   H =  8   O = 15   V = 22
	B = 2   I =  9   P = 16   W = 23
	C = 3   J = 10   Q = 17   X = 24
	D = 4   K = 11   R = 18   Y = 25
	E = 5   L = 12   S = 19   Z = 26
	F = 6   M = 13   T = 20
	G = 7   N = 14   U = 21	

You can send an answer to this assignment at most 4 times.

Note: if the items don't appear properly, choose the smallest possible font size that displays the letters properly. If the items don't fit on the screen after that, you should expand the browser window horisontally and reload the assignment with the reload-button of the browser.