Suppose we have two hash function h(k) = k%7 and h'(k) :6 - (k%7). Given the ordered input {30, 44, 22, 35, 33} and an empty hash table with size 7, answer the following questions. (Part A) Calculate the hashed key for every input: Кeys h(k) h'(k) 30 44 22 35 33 (Part B) Show the hash table using hash function h(k) and chaining (i.e., open address) with singly linked list after insert all the inputs (Sample answer: if keys 20, 30, and 40 are hashed into the same place with 20 being the first element and 40 being the last element, then the answer is 40->30->20; if a table entry is empty, then the answer is null.): Hash Table Index Кeys 1 2 3 4 5 6.

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
icon
Related questions
Question
100%

PLEASE HELP WITH PART A AND B WITH WORK AND ANSWER!!

**Hash Function and Hash Table Construction**

Suppose we have two hash functions \( h(k) = k \% 7 \) and \( h'(k) = 6 - (k \% 7) \). Given the ordered input \(\{30, 44, 22, 35, 33\}\) and an empty hash table with size 7, answer the following questions.

### Part A: Calculate the Hashed Key for Every Input

| Keys | \( h(k) \) | \( h'(k) \) |
|------|------------|------------|
| 30   |            |            |
| 44   |            |            |
| 22   |            |            |
| 35   |            |            |
| 33   |            |            |

### Part B: Show the Hash Table Using Hash Function \( h(k) \) and Chaining

With singly linked list after inserting all the inputs. If keys are hashed into the same place, list them in order of insertion. If a table entry is empty, it is noted as **null**.

**Sample Answer:** If keys 20, 30, and 40 are hashed into the same place with 20 being the first element and 40 the last, the entry is \( 40 \rightarrow 30 \rightarrow 20 \). If a table entry is empty, it is **null**.

| Hash Table Index | Keys              |
|------------------|-------------------|
| 0                |                   |
| 1                |                   |
| 2                |                   |
| 3                |                   |
| 4                |                   |
| 5                |                   |
| 6                |                   |

This exercise involves evaluating hash values and effectively managing collisions using chaining.
Transcribed Image Text:**Hash Function and Hash Table Construction** Suppose we have two hash functions \( h(k) = k \% 7 \) and \( h'(k) = 6 - (k \% 7) \). Given the ordered input \(\{30, 44, 22, 35, 33\}\) and an empty hash table with size 7, answer the following questions. ### Part A: Calculate the Hashed Key for Every Input | Keys | \( h(k) \) | \( h'(k) \) | |------|------------|------------| | 30 | | | | 44 | | | | 22 | | | | 35 | | | | 33 | | | ### Part B: Show the Hash Table Using Hash Function \( h(k) \) and Chaining With singly linked list after inserting all the inputs. If keys are hashed into the same place, list them in order of insertion. If a table entry is empty, it is noted as **null**. **Sample Answer:** If keys 20, 30, and 40 are hashed into the same place with 20 being the first element and 40 the last, the entry is \( 40 \rightarrow 30 \rightarrow 20 \). If a table entry is empty, it is **null**. | Hash Table Index | Keys | |------------------|-------------------| | 0 | | | 1 | | | 2 | | | 3 | | | 4 | | | 5 | | | 6 | | This exercise involves evaluating hash values and effectively managing collisions using chaining.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Blockchaining
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education