This preview shows page 1. Sign up to view the full content.
Unformatted text preview: table of length m = 7 using hash function h ( k ) = 2 k 2 mod m . a) Using h(k) as the primary hash function, illustrate the result of inserting these keys using open addressing with linear probing. b) Using h(k) as the primary hash function, illustrate the result of inserting these keys using open addressing with quadratic probing, where c 1 =2 and c 2 =1. c) Using h(k) as the hash function, illustrate the result of inserting these keys using chaining. Compute the load factor for the hash table resulting from the insertions. d) What different values can the hash function h ( k ) = 2 k 2 mod m produce when m = 7? Carefully justify your answer. 3. (40 points) Chapter 11: Textbook Problem 111 on p. 282 (a)  (d)....
View
Full
Document
This note was uploaded on 02/13/2012 for the course CS 91.404 taught by Professor Dr.karendaniels during the Fall '09 term at UMass Lowell.
 Fall '09
 DR.KARENDANIELS
 Algorithms

Click to edit the document details