This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: {4371, 1323, 6173, 4199, 4344, 9679, 1989} , a hash table of size b = 10 , and a hash function h(x) = x mod b , show the final (i.e. resultant) hash table in each of the following cases. a. [6 points] An open hash table, with insertion at the front of the chain. b. [8 points] A closed hash table using linear probing. c. [8 points] A closed hash table using quadratic probing. d. [8 points] A closed hash table using double hashing, with the second hash function as: h’(x) = 7  (x mod 7). 2 which yields the sequence of hash functions: hi(x) = (x mod b + i ⋅ (7(x mod 7))) mod b, for i=0,1,… If, during the course of inserting into the hash table, you reach a point when it is not possible to complete the insertion, then note this in your writeup. Briefly explain what happened to prevent the insertion and why....
View
Full
Document
This note was uploaded on 10/30/2010 for the course CSE 2011 taught by Professor Nguyen during the Spring '10 term at Maple Springs Baptist Bible College.
 Spring '10
 nguyen
 Computer Science

Click to edit the document details