6. Hashing Given a hash table with m = 11 entries and the following hash function h1 and step function h2: 0 Show the status of the hash table after inserting the numbers using each method in Table 2. Table 2: The status of the hash table 1 #Linear Probing 2 انت 3 4 5 6 7 8 hl(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) into the hash table using each of the following hash methods: 9 Linear-Probing with h(k, i) = (h1(k)+ i) mod m • Double-Hashing with h1 as the hash function and h2 as the step function h(k, i) = (h1(k) +i * h2(k)) mod m 10 Chaining with h(k) - h1(k) = Double Hashing Chaining

6. Hashing Given a hash table with m = 11 entries and the following hash function h1 and step function h2: 0 Show the status of the hash table after inserting the numbers using each method in Table 2. Table 2: The status of the hash table 1 #Linear Probing 2 انت 3 4 5 6 7 8 hl(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) into the hash table using each of the following hash methods: 9 Linear-Probing with h(k, i) = (h1(k)+ i) mod m • Double-Hashing with h1 as the hash function and h2 as the step function h(k, i) = (h1(k) +i * h2(k)) mod m 10 Chaining with h(k) - h1(k) = Double Hashing Chaining

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

The hash table array has capacity of 10. Capacity is the number of slots present in the array that is used to build the hashtable. The hash function returns the absolute value of the key mod the capacity of the hash table. a) Insert these keys in the hash table: 3,23,11,21,1,7,77,8 where the hash table uses quadratic probing to resolve collisions. b) Search and Delete 3 and 11 from the table. Be careful about changing the status of the table slot to “deleted” after deleting each item. c)Search 23 and 21 from the table and print their position.
Assume a hash table utilizes an array of 13 elements and that collisions are handled by separate chaining. Considering the hash function is defined as: h(k)=k mod 13. i) Draw the contents of the table after inserting elements with the following keys: 36, 243, 261, 180, 217, 180, 21, 16, 182, 202, 91, 97, 166, 78, 33, 70, 51, 58.
An empty hash table hashTable has 20 buckets and a hash function of key % 20. The following operations are performed in order. Select which operations cause a collision. HashInsert(hash Table, 10) HashInsert(hashTable, 15) HashInsert(hash Table, 55) HashInsert(hashTable, 13) HashInsert(hashTable, 33)
3. Double hashing is one of the methods to resolve collision. Write a function to implement this method. The equations used in this method are given below. Note: implement everything within the double hash function. P = (P + INCREMENT(Key)) mod TABLE_SIZE INCREMENT(Key) = 1 + (Key mod INCR)
Course: Data Structure and Algorithms Language: Java Kindly something and Answer in 1 hour. Read Carefully and give answer with all necesary details. See the image for askii codes. Question6: In this Problem, you are required to insert some keys into a hash table, using given hash functions. You have to Draw a Hash table with the inserted keys. Write total number of collisions encountered when a particular collision resolution technique is used. size= 13, H(X) = sum of Ascii codes of key % HTSIZE Keys: Mia, Bea, Zoe, Jan, Ada, Sam, Leo, Meo, Ben, Tim, Ted, Zod Use Linear probing: H’(X) = [H(X) +f(i))] % HTSIZE where f(i)=i where i=0,1,2,….
T is an empty hash table. The size of T is 4 and the hash function is h(key) = key mod 4. Draw the hash table T after inserting the following item one by one: 24, 30, 29, 39, 30, 15, 14, 33.
Java - A chained hash table has an array size of 512; what is the maximum number of entries that can be placed in the table?
Using the modulus operator within a hash function or on the output of a hash function: Will always cause rehashing. Will cause the hash table to shrink. Can cause collisions. O Will always produce a unique hash bucket.
Exercise 3 - Simple hash table Develop a simple hashtable with specified size (parameter) that accepts key-value pairs and stores them in an internal structure. ● • The key has to be a string ● ● Use your hash function from exercise 2 • The value can be an object Demonstrate how your hashtable works with multiple inputs Implement add (key, value), get(key), and print () methods
60. The field on which the equality condition is placed is hashing technique is called a. hash field b. cluster filed c. spanned field d. sequential field
Trace Linear Probing with My Data A The hash table is size 7 and uses open addressing and linear probing. The hash function is hashCode(phone number) = last four digits % table size 555-1432 VoterA 555-6135 VoterB 555-2747 VoterC 555-6118 VoterD 555-5733 VoterE 555-4722 VoterF 555-7523 VoterG Show the hashCode of each Voter. Show the table after inserting the above voters in the listed order. Assume you want to retrieve each voter. How many seeks does it take to find each voter? How many seeks would it take to know that 555-5357 VoterH is not in the table? What does the table look like if you remove VoterF? Now how many seeks does it take to know that 555-5357 VoterH is not in the table? How many seeks does it take to retrieve voter G?
struct search_within_hash_table { // Function takes no parameters, searches a hash table for a book with an ISBN // matching the target ISBN, and returns a pointer to that found book if such // a book is found, nullptr otherwise. Book* operator()(const Book& unused) { //// TO-DO (21) ||| (/ //// // Write the lines of code to search for the Book within "my_hash_table" // with an ISBN matching "target_isbn". Return a pointer to that book // immediately upon finding it, or a null pointer when you know the book is // not in the container. // // NOTE: Do not implement a linear search, i.e., do not loop from beginning // to end. ///// END-TO-DO (21) |||// //// } std::unordered_map& my_hash_table; const std::string target_isbn; };