Question: The hash function h(k) = k mod m and linear probing are used to insert the keys 37, 38, 72, 48, 98, 11, 56 into

 The hash function h(k) = k mod m and linear probing

The hash function h(k) = k mod m and linear probing are used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a hash table of size = 7 having indices 0...6. The order of the hash codes in the array are given by A. 72, 11, 37, 38, 56, 98, 47 B. 98, 56, 37, 38, 72, 11, 48 C. 98, 11, 37, 38, 72, 56, 48 D. 11, 37, 48, 38, 72, 98,56 E. 11, 38, 98, 37, 72, 48, 56

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!