1.Question: Consider a hash table of size m=7. Draw the table that results after inserting the following keys: 19, 26, 13, 48 and 17 for each case: a. collision resolved with chaining, with hash function h(k)=k%7 b. collision resolved by linear probing, with hash function h1(k,i)=[h(k)+i] % 7 (i=0,1,..,m-1) c. collision resolved by quadratic probing, with hash function h1(k,i)=[h(k)+i²] % 7 (i=0,1,..,.m-1) d. collisions resolved by double hashing, with h2(k,i)=[h(k)+i*{5-(k%5)}]%7 (i=0,1,..,m-1)

1.Question: Consider a hash table of size m=7. Draw the table that results after inserting the following keys: 19, 26, 13, 48 and 17 for each case: a. collision resolved with chaining, with hash function h(k)=k%7 b. collision resolved by linear probing, with hash function h1(k,i)=[h(k)+i] % 7 (i=0,1,..,m-1) c. collision resolved by quadratic probing, with hash function h1(k,i)=[h(k)+i²] % 7 (i=0,1,..,.m-1) d. collisions resolved by double hashing, with h2(k,i)=[h(k)+i*{5-(k%5)}]%7 (i=0,1,..,m-1)

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

You just have to post the answer, I'll do the explanation myself.
Show the result when we insert the keys 5; 28; 19; 15; 20; 33; 12; 17; 10 into a hash table with collisions resolved by linked list at each slot. Let the hash table have 9 slots, and let the hash function be h(x) = (2x+1) mod 9. (You are expected to draw the final hash table)
extermal (overilow) chaining is used to resolve collisions. The hash function is suh DL. Consider a hash table with n buckets, where extermal (overilow) chaining is used t resolve collisions. The hash tunction is that the probability that a key value is hashed The hash table is to a particular bucket is initially empty and K distinct values a inserted in the table.
Answer the following ture or false question 1. The 9-entry hash table that results from using the hash function, h(i) = (2i+7) mod 9, to hash the keys 12, 5, 13, 4, 10, 19, 8, 3, and 28, assuming collisions are handled by linear probing as follows: 0 1 2 3 4 5 6 7 8 10 19 3 28 12 8 13 4 5 Group of answer choices True False 2. Here is how the built-in sum function can be combined with Python’s comprehension syntax to compute the sum of all numbers in an n x n data set, represented as a list of lists: sum(sum(subset) for subset in data) Group of answer choices True False 3. Here is the comparison for asymptotic growth rate: (logn) < (n) < (nlogn) < (n^2) < (n^3) < (2^n) Group of answer choices True False 4. Here is the Python’s list comprehension syntax to produce the list of this 26 characters ['a', 'b', 'c', ..., 'z']: [chr(k) for k in range(97, 123)] Group of answer choices True False
Given the hash function: h(i) = i % 13Show the array after inserting the following keys: 18, 41, 22, 44, 59, 32, 31, 73, in this order. Use linear probing to resolve collisions.
Suppose you have a hash table of size N = 64, and you are using quadratic probing. The keys in your hash are 4-digit integers (0000 through 9999) and your hash function is h(k) = (the sum of the digits in k). Assuming keys are uniformly random over the range 0000 to 9999, is this a good hash function? (Answer true for yes, false for no). True False
P5
7. Let T be a hash table in which collisions are resolved by chaining. Given a key k, briefly explain how a search operation for k in T works.
13. For the Hashing function h(x) = (x² + 1) mod 15, show how the data 5, 8, 20, 32 and 40 would be inserted in the order given in initially empty cells indexed 0 to 14. %3D
Prove the theorem Suppose that a hash function h is chosen randomly from a universal collection of hash functions and has been used to hash n keys into a table T of size m, using chaining to resolve collisions. If key k is not in the table, then the expected length E Œnh.k/ of the list that key k hashes to is at most the load factor ˛ D n=m. If key k is in the table, then the expected length E Œnh.k/ of the list containing key k is at most 1 C ˛.
Suppose we are hashing integers with 7-bucket hash table using the hash function h(i) = I mod 7. Show the resulting closed hash table with linear resolution of collisions (i.e., handling collisions with separate chaining) if the perfect cubes 1, 8, 27, 64, 125, 216, 343 are inserted.
Let us consider an empty hash table with 10 positions indexed from 0 to 9. Please illustrate the content of the hash table after inserting the elements 79, 8, 39, 48, 3, and 60 using(1) Quadratic Probing (2) Double hashing with h(k) = k%10 and h’(k)= 7-k%7