Exercise 1 Consider a hash table of size 13, and assume open addressing with linear probing   Show what the hash table will look like after the following items are added in the order shown. 26 54 77 90 27 30 28 52 96 65     What’s the load factor of the hash table after the values above are added?       If any of the values cause a collision, indicate which.       How many comparisons are needed to find 65 in the table? Briefly explain.       How many comparisons are needed to determine that 104 is not in the table? Briefly explain.       What’s the hash value computed for the string “dog”? Show your work.         Exercise 2 Suppose chaining is used as the method for collision resolution. Part A Show what the hash table will look like after the following items are added in the order shown. 26 54 77 90 27 30 28 52 96 65               How many comparisons are needed to find 65 in the table?         How many comparisons are needed to determine that 104 is not in the table? Briefly explain.         Exercise 3 Consider a hash table with a load factor of 0.8. What’s the average number of comparisons for a successful search assuming open addressing with linear probing?     What’s the average number of comparisons for a unsuccessful search given the same assumptions?

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

Exercise 1

Consider a hash table of size 13, and assume open addressing with linear probing

 

  1. Show what the hash table will look like after the following items are added in the order shown.

26 54 77 90 27 30 28 52 96 65

 

 

  1. What’s the load factor of the hash table after the values above are added?

 

 

 

  1. If any of the values cause a collision, indicate which.

 

 

 

  1. How many comparisons are needed to find 65 in the table? Briefly explain.

 

 

 

  1. How many comparisons are needed to determine that 104 is not in the table? Briefly explain.

 

 

 

  1. What’s the hash value computed for the string “dog”? Show your work.

 

 

 

 

Exercise 2

Suppose chaining is used as the method for collision resolution.

Part A

  1. Show what the hash table will look like after the following items are added in the order shown.

26 54 77 90 27 30 28 52 96 65

 

 

 

 

 

 

 

  1. How many comparisons are needed to find 65 in the table?

 

 

 

 

  1. How many comparisons are needed to determine that 104 is not in the table? Briefly explain.

 

 

 

 

Exercise 3

  1. Consider a hash table with a load factor of 0.8. What’s the average number of comparisons for a successful search assuming open addressing with linear

probing?

 

 

  1. What’s the average number of comparisons for a unsuccessful search

given the same assumptions?

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Dynamic Table
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