Consider the following scenario/łassumptions: . A hash table can store at most 11 elements. Indices are numbered from 0 to 10. It is currently empty (no elements yet). • The hashing function is defined as H(k) = k % 11 • The collision resolution technique is Linear Probing. Insert the following keys in the hash table in the sequence that they appear below: • 172458 282459 • 392458 •502461 612458 • 722463 832458 • 942465 • 1052458 • 1162467 Write on a piece of paper the contents of the resulting has table after inserting these keys. The table should contain 10 elements, with only one address that is left open, i.e., it is not occupied by any key. Answer the questions below by filling up the blanks. 1. What is the address (array index) of the memory space that is still open? 2. What is H(722463)? 3. In which address (array index) was key 832458 stored? 4. Which key value was stored in address (array index) 8? 5. The value of H(k) is called k's home address. How many keys were not stored in their respective home addresses?

Consider the following scenario/łassumptions: . A hash table can store at most 11 elements. Indices are numbered from 0 to 10. It is currently empty (no elements yet). • The hashing function is defined as H(k) = k % 11 • The collision resolution technique is Linear Probing. Insert the following keys in the hash table in the sequence that they appear below: • 172458 282459 • 392458 •502461 612458 • 722463 832458 • 942465 • 1052458 • 1162467 Write on a piece of paper the contents of the resulting has table after inserting these keys. The table should contain 10 elements, with only one address that is left open, i.e., it is not occupied by any key. Answer the questions below by filling up the blanks. 1. What is the address (array index) of the memory space that is still open? 2. What is H(722463)? 3. In which address (array index) was key 832458 stored? 4. Which key value was stored in address (array index) 8? 5. The value of H(k) is called k's home address. How many keys were not stored in their respective home addresses?

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

Assume we have a linear hash table of size 6. Assume we use the following hash function that takes the first character of a name and outputs the number shown at the last column of its corresponding row. Letters to hash AGMS YO BHNT Z1 CI OU 2 DJPV 3 EKQW 4 FLRX 5 Reorder the names to show how they'll be stored in the hash table if they are inserted in the following order: Arjav, Christian, Daniel, Parthiv, Yagnik Arjav Yagnik Null Christian Daniel Parthiv
Show the state of the index after each operation:a) Insertion of entry 2b) Insertion of entry 40c) Insertion of entry 39
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.
The following is a prioritised list of considerations that might impact a hash table's Big-O performance:
Given the following hash map array of size 10 (horrible array sizell) and a hashing function of num%arraysize: Array: 1 2 3 4 6. 30 43 54 25 27 If you were to next insert 73 into the map using linear probing, what index would it be placed at?
Assume the array below is used to implement a hash table. Assume we wish to insert the value 34 using Quadratic Probing, in which array index would the number be inserted? 643 64 64 5489 1545 5. 8. 9. 10 6479 216 215 47 15478 11 12 13 14 15 16 17 18 19 20 21 254 545 4548 548 549 22 23 24 25 26 27 28
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…
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.
1. Suppose you use hashing with separate chaining. The array is size 7, and the hashing function is hash(k) = k % 7. What is the result of putting these keys into the hash table in this order: 18, 11, 20, 12, 22, 25. 2A. Repeat Question 1, but using hashing with linear probing instead. Don't resize. B. Suppose we have put these keys in Question 2A. What is the result if we now delete 18?
4. fast please If h ( x ) = x mod 7 (i.e. the hash table has 7 rows) and separate chaining resolves collisions, what does the hash table look like after the following insertions occur: 5, 8, 10, 24, 15, 32, 17, 14, 19, 38? Assume that each node item contains only a search key for its data. Draw the FINAL representation of the hash table clearly
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.
The following is a prioritised list of considerations that might impact a hash table's Big-O performance: