4.* 10 Jaivia) Hash Tables with Probing. Consider a hash table of size M = 11 andsuppose our keys are non-negative integers. The hash function that is used by our hash tableis the following:int h(int key) {int x - (key + 7) * (key + 7);x - x / 16;x - x + key;x = x % 11;return x;}Suppose that collisions are resolve via linear probing. The integer key values listed below areto be inserted in the order given in the table. Show the initial slot (the slot to which the keyhashes, before any probing), the probe sequence (if any) for each key, and the final contentsof the hash table after the following key values have been inserted in the given order (showyour work):Key Value43Initial SlotProbe Sequece23115314.11Final Hash Table:Slot346.789 10Key

Key-Value Initial Slot Probe Sequence 43 1 Put in slot 1 23 2 Put in slot 2 1 5 Put in slot 5…

Answered: 4.* 10 Jaivia) Hash Tables with…

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

PYTHON Why am I getting an error and it doesn't show the right output? Problem 1# Implement a hashtable using an array. Your implementation should include public methods for insertion, deletion, and# search, as well as helper methods for resizing. The hash table is resized when the loadfactor becomes greater than 0.6# during insertion of a new item. You will be using linear probing technique for collision resolution. Assume the key to# be an integer and use the hash function h(k) = k mod m where m is the size of the hashtable. class HashTableProb: def __init__(self, size=10): # Initialize the hashtable with the given size and an empty array to hold the key-value pairs. self.__size = size # size of the hashtable self.__hashtable = [None for _ in range(size)] self.__itemcount = 0 # Keeps track of the number of items in the current hashtable def __contains__(self, key): return self.__searchkey(key) def __next_prime(self, x): def…
22 Consider a hash table with size m=7, fill the following items in the table if the hash function used is (6k-5) mod m. AAB, ABA,CDF,STW,YZQ,PFG (ASCII code) . Then count the number of collisions and solve the collision ( if possible) using one of the methods studied
Python Why am I still getting an error? # Problem 1# Implement a hashtable using an array. Your implementation should include public methods for insertion, deletion, and# search, as well as helper methods for resizing. The hash table is resized when the loadfactor becomes greater than 0.6# during insertion of a new item. You will be using linear probing technique for collision resolution. Assume the key to# be an integer and use the hash function h(k) = k mod m where m is the size of the hashtable. class HashTableProb: def __init__(self, size=10): # Initialize the hashtable with the given size and an empty array to hold the key-value pairs. self.__size = size # size of the hashtable self.__hashtable = [None for _ in range(size)] self.__itemcount = 0 # Keeps track of the number of items in the current hashtable def __contains__(self, key): return self.__searchkey(key) def __next_prime(self, x): def is_prime(x): return…
Can you give me example of quadratic probing in C++ ? The quadratic problem function has one input, call it m where m is a int. The return type is an int. For example, you have the serial number 2232012, quadProb(2232012) will return an int. Assume that the hash table size is 450. Assume that you are working with an uninitialized 2D array. Also write an insert() function to populate this 2D array.
20 a) Given a hashing function hash(x) = ((x * x) + x) % 11, Insert the value 17 into each hash table using the rules specified below. Note that some of the boxes in each hash table are already full. If there’s a collision, start the probing at i = 0 and increment from there if you collide. b) After we insert our new data (that 17) into these hash tables, should we resize and rehash the values? Why or Why not? c) If this was a hash table using separate chaining instead of linear probing, would it be time to rehash after we insert 17?
Please convert to C language //linear probing#include <bits/stdc++.h>using namespace std; void add_using_linear_probing(int hash[], int a){ //hash function h(x)=x%10 int k = a % 10; //linear probing while (true) { if (hash[k] == -1) { hash[k] = a; break; } k = (k + 1) % 10; //linear increment of probe }} int main(){ //set of input numbers vector<int> arr{ 123, 124, 333, 4679, 983 }; //initialize the hash table //each entry of the hash table is a single entry int hash[10]; //size of hashtable is 10 memset(hash, -1, sizeof(hash)); //initialize with empty initially for (int a : arr) { //hashing add_using_linear_probing(hash, a); } cout << "---------using linear probing---------\n"; cout << "Hash table is:\n"; for (int i = 0; i < 10; i++) { if (hash[i] == -1) cout << i << "->" << "Empty" <<…
Write a C++ program that: (1) defines and implements a hash class that constructs a 15 element vector, storing strings, using the following hash function: ((first_letter) + (last_letter) - (second_letter))% 15 So, for example, the word "rocky" would be ('r') = 114 + ('y') = 121 - ('o') = 111 = 124%15 = 4 In this example, an attempt would be made to store "rocky" in position 4. In the event of a collision, the word would be stored in the first available location, so if there is a collision in location 4, an attempt would be made to store the word in location 5. If an attempt to store a word in position 14 fails because the location is full circle back to location 0 because there is no location 15. If there is a collision in location 0, try location 1, and so on. I will not try your program with words that are shorter than three letters, so you do not need to consider shorter words. (2) the driver program should: a. query the user for ten words and store them…
Why is it giving me an error and what do I have to change? PYTHON # Problem 2# Implement a hashtable using an array. Your implementation should include public methods for insertion, deletion, and# search, as well as helper methods for resizing. The hash table is resized when the max chain length becomes greater# than 3 during insertion of a new item. You will be using linear chaining technique for collision resolution. Assume# the key to be an integer and use the hash function h(k) = k mod m where m is the size of the hashtable. You can use# python list methods in your implementation of the chain or you can also use your linked list implementation from# coding assignment 2, problem 1. You can make necessary changes to __hashtable initialization in the __init__ method# if you are using your linked list implementation. The provided code uses python lists for the __hashtable variable. class HashTableChain: def __init__(self, size=10): # Initialize the hashtable with the given…
2. Implement the hash table for the following elements: a. 22,32,45,67,89,9 Use Double hashing technique to handle the collision. [ hash1(key)=key%10, hash2(key)=PRIME- (key%PRIME) ].
Assume an open addressing hash table implementation, where the size of the array is N = 19, and that double hashing is performed for collision handling. The second hash function is defined as: d(k) = q -k mod q, where k is the key being inserted in the table and the prime number q is = 7. Use simple modular operation (k mod N) for the first hash function. i) Show the content of the table after performing the following operations, in order:put(45), put(25), put(12), put(61), put(38), put(88), remove(12), put(39), remove(61), put(18), put(29), put(29), put(35).i) What is the size of the longest cluster caused by the above insertions? ii) What is the number of occurred collisions as a result of the above operations? iii) What is the current value of the table’s load factor?
1) Suppose hashing is being done by using open addressing with linear probing. The hash function tobe used for an element with key k is h(k) = k mod 11. Show the contents of the hash table afterinserting the following keys in order into the hash table:27 40 22 15 31 18 36 19 20
Hash table is a data structure in which keys are mapped to array positions by a hash function. Theprocess of mapping the keys to appropriate locations in a hash table is called hashing. Hash functions areused to reduce the number of collisions.i. Mention the methods to minimize collision.ii. Explain the advantage of using double hashing over linear and quadratic probing techniques.iii. Load the keys given below in a hash table of size 7 in the same order using chaining with thehash function h(key)= key % 7. Show graphically how collisions are resolved using chainingin this particular case.12, 101, 3, 21, 14, 13, 16, 7, 141

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS