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 following is a prioritised list of considerations that might impact a hash table's Big-O performance:
please send me in 15 mins
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; };
You are asked to insert the following values into the hashing table size 9: 9, 18, 19, 27, 8, 17. Use linear probing if there is a collision. Your answer will be in the form of the order of inserted elements. The order of inserted elements:: 9 18 19 - - 27 8 - 17 The order of inserted elements: 9 18 19 27 - - 17 - 8 O The order of inserted elements: 9 18 19 27 17 - - -8 O The order of inserted elements: 9 18 19 27 8 - -17 -
If N items are inserted into a hash tabble of size H, what is the expected average chain length?
4. Given input keys of a file 130, 60, 98, 28, 38, 55 and a hash function with table-size=10. Show the results of double hash with Hash (key) = key%10 and Hash2( key ) = P- (key mod P) %3D
Jump to level 1 valsTable: o Empty-since-start 1 81 Empty-after-removal 2 Occupied 3 73 Hash table valsTable uses quadratic probing, a hash function of 4 key % 10, c1 = 1, and c2 = 1. 6 HashInsert(valsTable, item 41) inserts item 41 into bucket Ex: 10 7 HashInsert(valsTable, item 50) inserts item 50 into bucket 8 9 Hashlnsert(valsTable, item 53) inserts item 53 into bucket
Hashing (4’). For the input 30, 20, 56, 75, 31, 25 and hash function h(K) = K mod 12a. (1’) Construct the open hash table.b. (1’) Find the average number of key comparisons in a successful search in this table.c. (1’) Construct the closed hash table.d. (1’) Find the average number of key comparisons in a successful search in this table.
Given the array of size 17, and the hashing function h(x) = x%17, at which array location would data with key value 86 be stored? Assuming 35 and 69 have already been inserted in the array and the quadratic probing is used for collision. Question 10 options: 6 5 4 3
The following is a prioritised list of considerations that might impact a hash table's Big-O performance:
Best hash function will never create any collision among the hash table values. O True O False QUESTION 4 There exists a data structure to maintain a dynamic set with operations Insert(x), Delete(X) and Contains(X) that has an expected running time of O(1) per operation. O True O False
TOPIC: hash table with chaining * For the insert method, we use table[hash(new_entry)].insert(0, new_entry); Why do we insert the new entry at position 0 of the list, not at the end of the list? * When we search for key 100001, the time for each search methods are displayed. Rank the four methods (sequential, binary, hash table 1 and hash table 2) from the slowest to the fastest. * Explain the ranking of the search methods based on time complexity and load factor (for hashing).