A hash function h defined h(key)=key % 7 is used to insert the keys 44, 45,, 79, 55, 91, 19 into a table indexed from 0 to 7 (that is, HT[0], HT [1],HT[2],HT(3],HT[4],HT[5], HT[6], HT[7] ). Show the how these keys, in the order given, are inserted in HT using the above hashing function when collisions are handled by 1) a linear probing, and 2) double hashing using a second hash function g(k)=D5 - (key%5). The double hashing rule is (h(X) +i*g (X)) % HTSize, i=0,1,2,..). Note that some keys (44, 45, 55 ) are already inserted. You need to inser the keys, 79, 91, 19 into the hash table.

A hash function h defined h(key)=key % 7 is used to insert the keys 44, 45,, 79, 55, 91, 19 into a table indexed from 0 to 7 (that is, HT[0], HT [1],HT[2],HT(3],HT[4],HT[5], HT[6], HT[7] ). Show the how these keys, in the order given, are inserted in HT using the above hashing function when collisions are handled by 1) a linear probing, and 2) double hashing using a second hash function g(k)=D5 - (key%5). The double hashing rule is (h(X) +i*g (X)) % HTSize, i=0,1,2,..). Note that some keys (44, 45, 55 ) are already inserted. You need to inser the keys, 79, 91, 19 into the hash table.

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

Computer Science A hash function h defined h(k)=k mod 7, and linear probing is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18?
Give the contents of the resulting hash table when you insert items with the keys L A G U N I V E R S in that order into an initially empty table of M = 5 lists, using separate chaining with unordered lists. Use the hash function 11k mod M to transform the kth letter of the alphabet into a table index. Example: hash(J) hash(10) = 110 % 5 = 0
Does a hash table of size m contain the same number of linked lists at all times? No matter how hard I attempt, I cannot identify the purpose of a hash function. Provide an example to illustrate your point.
Is there a predetermined limit to the number of linked lists that may be included inside a hash table of size m? Hash functions continue to baffle me, and I have no idea how to interpret their intended use. Give an example to explain the point you're making.
In order for the hash function (a * k)% M to generate distinct values (no collisions) for the keys S E A R C H X M P L, a program must be written to find values of a and M, with M as small as possible.................. "..
Write a program to find values of a and M, with M as small as possible, such that the hash function (a * k) % M for transforming the kth letter of the alphabet into a table index produces distinct values (no collisions) for the keys S E A R C H X M P L. The result is known as a perfect hash function
Is there a certain number of linked lists that are always included inside a hash table of size m? To save my life, please explain what the purpose of a hash function is since I have not the faintest clue. Provide an example to support your idea.
Show what occurs when the keys 5, 28, 19, 15, 20, 33, 12, 17, and 10 are inserted into a hash table with collisions addressed by chaining. If the table has nine slots, then the hash function should be h.k/D k mod nine.
1. Give the contents of the resulting hash table when you insert items with the keys L A G U N I V E R S in that order into an initially empty table of size M = 16 using linear probing. Use the hash function 11k mod M to transform the kth letter of the alphabet into a table index. Example: hash(J) hash(10) = 110 % 16 = 14 Show the detailed solution for each key and plot the items in the hash table.
Suppose there are six workers, in a workshop, with IDs 147, 169, 580, 216, 974, 567, 495, 555, and 124. Suppose hash table, HT, is of the size 13, indexed 0, 1, 2, . . ., 12. Show how these workers’ IDs, in the order given, are inserted in HT using the hashing function h(k) = k % 13. Draw two hash tables (one for a, and another for b) with integer keys in each slot. Use linear probing to resolve collision. Use quadratic probing to resolve the collision.
Given a hash table of size M=10 and a linear probing method, following are the contents of the hash table: [-1, 41, 71, -1, 64, 75, 84, -1, 88, 9]. -1 indicates slot is empty. Use the standard hash function: h(x)=x%M Match the index on the left with the value on the right for the hash table after the following operations are carried out in the given order: delete(88) delete(41) delete(44) insert(108) insert(71)
Suppose we have a hash table of size 11 and use the hash function h(key) = (key + i) % 11, where i = 0, 1, 2, ..., 10. After inserting entries with keys 35, 29, 54, 43, 121, 33, 44, and 187. What is the index of key 121? index = {0, 1, 2, ..., 10}