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

Using the values provided below, show the hash key and what the hash table will look like when using the two different techniques indicated. The hash function used is based upon the first letter of the person's last name. The array size is 27 Index 0 is not used The letter 'A' will go to index 1, 'B' to index 2, etc Separate chaining Open addressing with linear probing i_table = ( h(k) + j ) mod S where i is the index of the underlying array,h is the hash function,j is the iteration of the probe, andS is the size of the table Values needing to be hashed (in order from top to bottom) Big Bird The Penguin Jackie Chan The Joker The Riddler Lewis Carroll Arthur Doyle Clark Kent Clive Lewis Lois Lane Yogi Bear Charles Dickens Geoffrey Chaucer Mr Ranger William Shakespeare John Tolkien Fred Rogers
What is the average time complexity to delete a key from a chaining hash table? (Assume that the table size is k; and the hash table hold m data)
The following is a prioritised list of considerations that might impact a hash table's Big-O performance:
please send me in 15 mins
Given hash function h(key), when inserting an item with key k to the hash table A, which linked list and position the item should be placed?
You are asked to insert the following values into the hashing table size 9: 9, 18, 19, 27, 8, 17. Use linear probing if there is a collision. Your answer will be in the form of the order of inserted elements. The order of inserted elements:: 9 18 19 - - 27 8 - 17 The order of inserted elements: 9 18 19 27 - - 17 - 8 O The order of inserted elements: 9 18 19 27 17 - - -8 O The order of inserted elements: 9 18 19 27 8 - -17 -
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.
What is the total number of linked lists in a chaining hash table of size T? What kind of basic data structures are contained in the Separate Chaining hash table?
If N items are inserted into a hash tabble of size H, what is the expected average chain length?
For a hash table of size 23, the hash function used is h1(key)=key%23. Initially the table contains a single key stored in the table at location 15. If double hashing is used, and h2(key) = 7 – key%7, where will the next 3 keys (key1=15, key2=84, key3=383) that hash to location 15 be stored? Question 12 options: 6, 19, 24 21, 22, 17 21, 14, 20 6, 13, 14
4. Given input keys of a file 130, 60, 98, 28, 38, 55 and a hash function with table-size=10. Show the results of double hash with Hash (key) = key%10 and Hash2( key ) = P- (key mod P) %3D
Hashing (4’). For the input 30, 20, 56, 75, 31, 25 and hash function h(K) = K mod 12a. (1’) Construct the open hash table.b. (1’) Find the average number of key comparisons in a successful search in this table.c. (1’) Construct the closed hash table.d. (1’) Find the average number of key comparisons in a successful search in this table.