Consider a hash table of size 11 with hash function h(x) = 2x mod 11. Draw the table that results after inserting, in the given order, the following values: 65, 75, 68, 26, 59, 31, 41, 73, 114 for each of the three scenarios below: a) When collisions are handled by separate chaining; b) When collisions are handled by linear probing; c) When collisions are handled by double hashing using a second hash function h'(x) = (x mod 5) + 1. Hint, the overall (combined) hash function is H(x) = (h(x) + i xh'(x)) mod 11., where i = 0. 1. 2. 3.

Consider a hash table of size 11 with hash function h(x) = 2x mod 11. Draw the table that results after inserting, in the given order, the following values: 65, 75, 68, 26, 59, 31, 41, 73, 114 for each of the three scenarios below: a) When collisions are handled by separate chaining; b) When collisions are handled by linear probing; c) When collisions are handled by double hashing using a second hash function h'(x) = (x mod 5) + 1. Hint, the overall (combined) hash function is H(x) = (h(x) + i xh'(x)) mod 11., where i = 0. 1. 2. 3.

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

Consider a hash table of size M using separate chaining with ordered lists and the hash function hash(k) = k mod M. a) Assume N items have already been inserted in the table. What is, in average, the cost (number of operations) needed for searching an item in the table? Justify your answer. b) Assume N items have already been inserted in the table. What is, in average, the cost (number of operations) needed for inserting the next (N+1)th item? Justify your answer.
Consider a hash table with open addressing with 11 slots. Using the hash function h(x) = x mod 11, insert the keys (52,44,56,61,64) into the table in the same order. Assume that keys 0,1,8,9 already in the table .Use Linear probing and Quadratic probing for collision resolution Show the results in the two separate tables
Consider a hash table with open addressing with seven slots. Using the hash function h(x) = x mod 7, insert the keys (15,17,8,23,3,5) into the table in the same order. Use Linear probing and Quadratic probing for collision resolution Show the results in the two separate tables
Consider a Hash Table with 6 bins. Show the content of the Hash Table (that uses chaining to handle collisions) after the following numbers are inserted into the table in order: 0 1 6 7
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 the following keys {336,121,613, 93, 63, 17, 10, 53} for insertion into a hash table, and using a hash function h(k)= k mod m, m = 11, show the resulting:(i) Quadratic probing hash table(ii) Linear probing hash table(iii) Separate chaining hash table
Answer the following questions for a hash table of size T storing n items: What are the main operations that a hash table supports and what is the average and worst time complexity, respectively, of each operation?
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 the original attempt to insert an element into a hash table of size 11 fails, where the initial hash function computation, h(k), is 9 (i.e. h(k) = 9). In an attempt to resolve collision using quadratic probing. the first probe point also fails. What alternative index location will then be considered for the next possible insertion?
Given an array A {361,313, 163,179, 334, 659, 969, 934} and a hash functionh(x) = (x mod 11), show the results: (The answers must show where the collision occurs.) (1). Separate chaining hash table. (2). Hash table using linear probing. (3). Hash table using quadratic probing. (c1 = 0, c2 = 1) (4). Hash table with second hash function h2 (x) = 7 − (x mod 7).
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)
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