1. Given the following keys: 323, 156, 731, 125, 73, 200 The size of the hash table is 11 The hash function, h(k) = k mod m Use Quadratic Probing to resolve any collision, with constants C₁ = 1 and C₂ = 2 First compute the hash values using h(k) function and construct a table of k and h(k) as shown below: k H(K) 323 156 731 125 73 200 Show sample computations for h(k) Now construct a Hash Table of size 11 and place the keys (k) properly. Must give proper explanations and show computational details for each collision.

1. Given the following keys: 323, 156, 731, 125, 73, 200 The size of the hash table is 11 The hash function, h(k) = k mod m Use Quadratic Probing to resolve any collision, with constants C₁ = 1 and C₂ = 2 First compute the hash values using h(k) function and construct a table of k and h(k) as shown below: k H(K) 323 156 731 125 73 200 Show sample computations for h(k) Now construct a Hash Table of size 11 and place the keys (k) properly. Must give proper explanations and show computational details for each collision.

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

Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing the following keys in the table: 0, 12, 42, 18, 6, 22, 8, 105, 97
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)
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?
Assume that a hash table has a length of 14 and that the hash function is h(key)=key%11. The table only has four nodes: H(15)=4, H(38)=5, H(61)=6, H(84)=7, while the other spaces are empty. What is the node address of 49 if the linear detection approach is used to manage the conflict? 0 8 3 Nothing above
B) Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing the following keys in the table: 0, 12, 42, 18, 6, 22, 8, 105, 97
Consider a hash function h(x) = x mod 2256, that is, the hash function returnsthe last 256 bits of x.Does this function havea. collision resistanceb. irreversibilityc. puzzle friendlinessWhy or why not?
Consider a hash table of size 11 with hash function h(x) = x mod 11. Draw the tablethat results after inserting, in the given order, the following values: 26, 57, 40, 50,13, 33, and 72 for each of the three scenarios below: i. When collisions are handled by separate chaining. ii. When collisions are handled by double hashing using a second hash function ℎ’(?) = (? ??? 7) + 1. Hint, the overall (combined) hash function is ?(?) = ( ℎ(?) + ? × ℎ′(?) ) ??? 11, where i = 0, 1, 2, 3, … iii. When collisions are handled by quadratic probing with a quadratic probe function ℎ′(?,?) = (ℎ(?) + 0.5 ? + 0.5 ?2) ??? 11 where ? = 1, 2, 3,….
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)
Insert keys {10, 22, 11, 31, 24, 88, 38, 21} into an empty hash table with CAPACITY = 10 using quadratic probing (c1=0 and c2=1) to resolve collision (You shouldn't use a for/while loop except to increment the value of i for quadratic probing). Use the hash function is h(k, i) = (h’(k) + c1* i + c2* i^2) mod 10 and h’(k) = k mod 10.
1. 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., ∀ a1, a2 ∈A, H(a1) ≠H(a2) If yes, please give the function. Otherwise, please explain. (Hint: pigeonhole principle) 2. Bob has uploaded a very large file in his online file storage. Later, he needs to download the file and verify whether the file has been modified. A. If a cryptographic hash function can be applied, briefly describe how to use a hash function to file integrity checking? B. Why doesn't Bob save the whole big file locally and directly compare it to the file he downloads?
Consider a hash table (hash function and hashing scheme) and its maincharacteristics.Which of the following is FALSE ?O A hash function's output is deterministic.O Linear Probe Hashing is the most basic hash function.O A hash table provides on average O(1) operation complexity.O A hashing scheme handles key collisions after hashing.
Suppose you are given the following set of keys to insert into a hash table that holds exactly 11 values: 113, 117, 97, 100, 114, 108, 116, 105, 99. Using the hash function= value %table_size. Which of the following best demonstrates the contents of the hash table after all the keys have been inserted using linear probing? 100,__,__,113,114,105,116,117,97,108,99 99,100,__,113,114,__,116,117,105,97,108 100,113,117,97,14,108,116,105,99,__,__ 117,114,108,116,105,99,__,__,97,100,113