Use the hash function h(x) = x mod 11 to load the following values 25, 14, 36, 47 using each offollowing to resolve collisions:(а) с(i) — +iindex 0134568103321(b) с()= +i?index 012 345 678 9103321(c) c(i) = i * hp(x) where h,(x) = 1 +x mod 10%Dindex1234578103321

Answered: Image /qna-images/answer/8099da4b-4c5a-4da0-8017-a23825bc207a.jpg

Use the hash function h(x) =x mod 11 to load the following values 25, 14, 36, 47 using each of following to resolve collisions: (а) с () — +i index 0 1 2 3 4 5 6 7 8 9 10 33 21 (b) c(i) = ±i? index 0 1 2 3 4 5 6 7 8 9 10 33 21 (c) c(i) = i * h,(x) where h,(x) = 1+x mod 10 index 0 1 2 3 4 5 6 7 8 9 10 33 21

Use the hash function h(x) =x mod 11 to load the following values 25, 14, 36, 47 using each of following to resolve collisions: (а) с () — +i index 0 1 2 3 4 5 6 7 8 9 10 33 21 (b) c(i) = ±i? index 0 1 2 3 4 5 6 7 8 9 10 33 21 (c) c(i) = i * h,(x) where h,(x) = 1+x mod 10 index 0 1 2 3 4 5 6 7 8 9 10 33 21

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Given the hash function H (key) = (3 * key) mod 11, use square probe to solve the conflict. Please construct a hash table for the keyword sequence {6,8,10,17,20,23,33,41,59,60} in the hash table whose length is 11.
Use the following double hash function to insert the keys. h:(k) = k mod 13 h2(k) = 1+ (k mod 11) h(k,i) = (h:(k) + i h2(k) ) mod 13 Keys = (69, 79, 98,72, 14,50,17,30,43} Prove or disprove 22n = O (2")?
Problem 1: After inserting 13 elements into a hash table the result looks as in Figure ??. Being a good student, you realize this is a problem. (i) What is the problem here? (ii) Give an example of a hash function that could give rise to this behavior. (iii) What would be a better hash function? 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 0 →30 →→2131 → 1 2 → 33 →15 → 63 → 266 388 Slika 1: Hash table.
Given the input set A = {1, 2, 3, 4, 5} and output set B = {1, 2, 3, 4}, is it possible to find a hash function H from A to B that has no hash collision, i.e., LaTeX: \forall ∀ a1, a2 LaTeX: \in ∈A, H(a1) LaTeX: \ne ≠H(a2) If yes, please give the function. Otherwise, please explain. (Hint: pigeonhole principle)
Suppose we use a hash function h to hash n distinct keys into an array T oflength m. Assuming simple uniform hashing, what is the expected number ofcollisions? More precisely, what is the expected cardinality of ffk; lg W k ¤ l andh.k/ D h.l/g?
For the set of keys {17, 9, 34, 56, 11, 4, 71, 86, 55, 10, 39, 49, 52, 82, 31, 13, 22,35, 44, 20, 60, 28} obtain a hash table HT[0..8, 0..2] following quadratic probing.Make use of the hash function H(X) = X mod 9. What are your observations?
Consider a hash table of size m = 7 and a corresponding hash function h(k) = k mod 7, where a value of k is computed using a folding method. In folding method key is divided into some segment of length 3. Compute the location to which the key 749287198 is mapped. An Index of the hash table starts from 0. A 1 В C 3 D 4
In Hash table H, collision is resolved by using chaining. There are 29 slots in H. The average number of elements stored in a chain is 130. What is the total number of elements stored in H?
None
Universal Hash Family. Here, we're considering the following scenario. The universe U of all possible key values is super large, compared to n, the number of actual keys we have. If you choose a hash function from all possible functions from U to {0, 1,., t- 1}, what goes wrong?