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

See similar textbooks

Related questions

Question

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?

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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