Suppose that the size of the hash table is 101. Further suppose that certain keys with the indices 15, 101, 116, 0, and 217 are to be inserted in this order into an initially empty hash table. Using modular arithmetic, find the indices in the hash table if: Linear probing is used. а. b. Quadratic probing is used.

Suppose that the size of the hash table is 101. Further suppose that certain keys with the indices 15, 101, 116, 0, and 217 are to be inserted in this order into an initially empty hash table. Using modular arithmetic, find the indices in the hash table if: Linear probing is used. а. b. Quadratic probing is used.

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

For the set of keys {17, 9, 34, 56, 11, 4, 71, 86, 55, 10, 39, 49, 52, 82, 31, 13, 22,35, 44, 20, 60, 28} obtain a hash table HT[0..8, 0..2] following quadratic probing.Make use of the hash function H(X) = X mod 9. What are your observations?
Insert the given inputs 4371, 1323, 6173, 4199, 4344, 9679, 1989 into a fixed table size of 10, show the results of the output table when using following methods for collision resolution. (a) Linear probing (b) Quadratic probing (c) Double hashing, use the second hash function as G(K)= 7-K mod 5
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
Consider a CBHT (closed bucket hash table) in which the keys are student identifiers. Assume that the number of buckets m = 100 and hash function 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, and 970023. Show the effect of deleting 000014 from the hash table.
Prove that In a hash table in which collisions are resolved by chaining, a successful searchtakes average-case time ‚.1C˛/, under the assumption of simple uniform hashing.
Given the input set A = {1, 2, 3, 4, 5} and output set B = {1, 2, 3, 4}, is it possible to find a hash function H from A to B that has no hash collision, i.e., LaTeX: \forall ∀ a1, a2 LaTeX: \in ∈A, H(a1) LaTeX: \ne ≠H(a2) If yes, please give the function. Otherwise, please explain. (Hint: pigeonhole principle)
Using quadratic probing, create a hash table HT[0..8, 0..2] for the collection of keys 17, 9, 34, 56, 11, 4, 71, 86, 55, 10, 39, 49, 52, 82, 31, 13, 22, 35, 44, 20, 60, and 28.Use the hashing formula H(X) = X mod 9. What conclusions have you drawn?
Suppose there are eight students with IDs 106500361, 120987540, 132490004, 134052199, 153450900, 175342111, 187800977, and 198966574. Suppose hash table, HT, is of the size 19, indexed 0, 1, 2, . . ., 18. Show how these students’ IDs, in the order given, are inserted in HT using the hashing function h(k)= k % 19. Use linear probing to resolve collision.
Consider a hash table of size m = 8 with hash function h(k) = (3k+2) mod m. Draw the tablethat results after inserting, in the given order, the following values: 13, 49, 33, 26, 38, 87, 26,67 Handle collisions by linear probing.
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).
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.
Is it always the case that a hash table of size m contains exactly m linked lists? I've been trying to understand the value of hash functions without success. Throw in a real-world case study to back up your claims.