Question 12 In Data Structure and Algorithms Given an initially empty hash table which uses an open addressing (quadratic probing) collision policy, assume this table uses a mid squaring function - i.e. for key 139, hashcode(139) = 3*3 = 9, so the key 139 will be placed in arr[9]. Show the changes to the table for the sequence of operations below. (The table for part b) must copy all the items from your answer to part a).) Only keys (no values) are shown in the function calls below. Note that the table has 11 buckets. Assume the table is not resized. a) insert (161): 0 0 b) insert (576): 0 0 1 c) insert (738): 0 1 d) insert (581): 0 1 0 1 2 e) insert (698): 1 2 f) insert (831): 1 2 1 g) insert (458): 2 2 3 3 3 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 7 7 7 7 8 8 8 8 8 8 9 9 9 9 10 10 10 10 10 10 10

Question 12 In Data Structure and Algorithms Given an initially empty hash table which uses an open addressing (quadratic probing) collision policy, assume this table uses a mid squaring function - i.e. for key 139, hashcode(139) = 3*3 = 9, so the key 139 will be placed in arr[9]. Show the changes to the table for the sequence of operations below. (The table for part b) must copy all the items from your answer to part a).) Only keys (no values) are shown in the function calls below. Note that the table has 11 buckets. Assume the table is not resized. a) insert (161): 0 0 b) insert (576): 0 0 1 c) insert (738): 0 1 d) insert (581): 0 1 0 1 2 e) insert (698): 1 2 f) insert (831): 1 2 1 g) insert (458): 2 2 3 3 3 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 7 7 7 7 8 8 8 8 8 8 9 9 9 9 10 10 10 10 10 10 10

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

Q20. In the open addressing solution to the collision problem in the following hash table, the value 40 is stored in the index PARERINGS 13 O 1 * 5 6 12 0 45 1 2 3 77 19 LO 6 7 22 8 9 10 11 12 13 14 84 70 56 28 59
3. (A) Show the result when putting the keys 19,12,14,13,9 into a hash table of size 7, usingHashing with Linear Probing. The hash function is hash(k) = k mod 7. Don’t resize.(B) Continuing from part A, show the result after deleting 19.
Given input keys of a file 130, 60, 98, 28, 38, 55 and a hash function with table-size=10. Show the results of:a). Hashing with open-addressing using linear probingb). Hashing with Chaining
Question 15
Explain the operation of secure hash algorithm on 512 bit block.
keys=12, 101, 3, 21, 14, 13, 16, 7, 96
2. Consider the Linear Hashing index. Linear Hashing | h1 000 001 010 011 ho ठ 00 01 10 11 Mod 8 (%68) Mod 4 (%4) 16* 21* 40* 37* 14* 18* 6* Primary Page 13* A. Show the resulting index after inserting the entry 9* C. Show the resulting index after inserting entry 7* 31* 19* 11* 23* B. Show the resulting index after inserting the entry 3* 30* D. Show the resulting index after inserting the entry 22* Overflow Page
1. The performance of hash table O A Related to the method of handling conflicts, not the length of the table O B It has nothing to do with the method of handling conflicts, but with the length of the table OC It is related to the conflict handling method and table length OD It has nothing to do with conflict handling methods and table length 2 When using binary search, the linear list must be A Store in Sequential List B Store in linked List OC Store in Sequential List, and the list is ordered by keywords OD Store in linked List, and the list is ordered by keywords
Hashing is an implementation technique often used when implementing certain data structure.Describe how hashing works “ by using a figure”- Under what conditions can access operations like remove, get and add have time complexity O(1)?
Q2. A separate chaining needs less memory than the open addressing to solve * the collision problem in the hash data structure. O True False
Questions 19