e table should contain 10 elements, with only one address that not occupied by any key. Answer the questions below by filling

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

1. Hashing and Linear Probing for Collision

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.
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?
6. In which address was key 380237 stored?
Transcribed Image Text: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. 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? 6. In which address was key 380237 stored?
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:
• 160237
• 270238
• 380237
• 490240
• 600237
• 710242
• 820237
• 930244
• 1040237
• 1150246
Transcribed Image Text: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: • 160237 • 270238 • 380237 • 490240 • 600237 • 710242 • 820237 • 930244 • 1040237 • 1150246
Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Procedures in SQL
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