3. Given a hash table with m=11 entries and the following hash function h1 and step function h2: h1 (key) = key mod m h2 (key) = {key mod (m-1)} + 1 Insert the keys {22, 1, 13, 11, 24, 33, 18, 42, 31} in the given order (from left to right) to the hash table using each of the following hash methods: a. Chaining with h1= h (k) = hl(k) b. Linear-Probing with h1 = h(k,i) = (h1(k)+i) mod m c. Double-Hashing with h1 as the hash function and h2 as the step function = h(k,i) = (h1 (k) + ih2(k)) mod m Hash Table Chaining Linear Probing Double Hashing 1 2 3 4 5

3. Given a hash table with m=11 entries and the following hash function h1 and step function h2: h1 (key) = key mod m h2 (key) = {key mod (m-1)} + 1 Insert the keys {22, 1, 13, 11, 24, 33, 18, 42, 31} in the given order (from left to right) to the hash table using each of the following hash methods: a. Chaining with h1= h (k) = hl(k) b. Linear-Probing with h1 = h(k,i) = (h1(k)+i) mod m c. Double-Hashing with h1 as the hash function and h2 as the step function = h(k,i) = (h1 (k) + ih2(k)) mod m Hash Table Chaining Linear Probing Double Hashing 1 2 3 4 5

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

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.
1. Suppose you use hashing with separate chaining. The array is size 7, and the hashing function is hash(k) = k % 7. What is the result of putting these keys into the hash table in this order: 18, 11, 20, 12, 22, 25. 2A. Repeat Question 1, but using hashing with linear probing instead. Don't resize. B. Suppose we have put these keys in Question 2A. What is the result if we now delete 18?
8. Insert the following keys one-by-one into an initially empty hash table of size 7. Use the hash function h(x) = x mod 7 Show the result for {10, 1, 18, 15, 26, 11, 19} (a) a separate chaining hash table (do not rehash if the load factor becomes too large). (b) a table with linear probing, i.e. using the probing function f(i) = i. For parts (c) and (d), it is possible that you will not be able to insert some of the keys into the table. If you find such a key, rehash the table into a new table of size 11. You need to modify the hash function h(x) accordingly to adjust for the new table size. You do not have to change g(x) for part (d). Do not rehash earlier for any of the tables (even if the load factor becomes too large). (c) a table with quadratic probing, i.e. using the probing function f(i) = i² (d) a table that uses double hashing with a secondary hash function, i.e. f(i) = i* g(x), where the secondary hash function is g(x) = 5 - (x mod 5).
4. fast please If h ( x ) = x mod 7 (i.e. the hash table has 7 rows) and separate chaining resolves collisions, what does the hash table look like after the following insertions occur: 5, 8, 10, 24, 15, 32, 17, 14, 19, 38? Assume that each node item contains only a search key for its data. Draw the FINAL representation of the hash table clearly
Extendible hash index:Consider the Extendible Hashing index shown in figure below: Show the state of the index after each operation:a) Insertion of entry 1b) Insertion of entry 23c) Deletion of entry 30 draw the figures separately for a, b and c
All of these statements are related to hash function, hash table.
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)
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
Let us consider a hash table with an underlying array of length 5. It is initially empty, and we then add consecutively the integers: 44, 7, 45, 21, 8, 23, 0, 33 Draw the resulting hashtable after all additions are made. Assume that the hash function used is the remainder of dividing by 5, that is: def hash(d): return d%5 You do not need to consider resizing the underlying array.
Consider a open bucket hash table and closed bucket hash table in which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function: m = 100; hash(id) = first two digits of id #. Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, 970023. Use following function as second hash function hash(id) = last digit of id # Show the effect of deleting 000014 from the hash table. (Java Programming DSA)
2. Give the use of a hash function, Draw the hash table that results using the hash function: hik)-k mod 13 to hash the keys 2. 7.4, 41, 15, 32. 25, 11, 30. Assuming collisions are handled by Quadratic probing. 3. Draw the hash table that results using the hash function: h(k)-k mod 13 to hash the keys 2,7,4, 41, 15, 32, 25. 11, 30. Assuming collisions are handled by Linear probing 4. Draw the hash table that results using the hash function: h(k)-kmod7 to hash the keys 76. 93. 40, 47, 10. 55. Assuming collisions are handied by Double hashing.
Computer science question