1. Given the following hash function for storing records on courses: f(title) = ASCII value of first character in the title - 64 Example: f(Biology I) = 66 – 65 = 1 (ASCII value of B is 66) a. Explain why this is or is not a good hash function. b. What improvement(s) could be made? 2. Assume that the hash function is: f(key) = key % B a. What is the problem if B is too small? b. What is the problem if B is too large? c. What is the big-0 run-time if there are n records? d. What does the run-time for a find, insert, and delete each approach as B gets very large?
1. Given the following hash function for storing records on courses: f(title) = ASCII value of first character in the title - 64 Example: f(Biology I) = 66 – 65 = 1 (ASCII value of B is 66) a. Explain why this is or is not a good hash function. b. What improvement(s) could be made? 2. Assume that the hash function is: f(key) = key % B a. What is the problem if B is too small? b. What is the problem if B is too large? c. What is the big-0 run-time if there are n records? d. What does the run-time for a find, insert, and delete each approach as B gets very large?
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
Related questions
Question
1. Given the following hash function for storing records on courses:
f(title) = ASCII value of first character in the title - 64
Example: f(Biology I) = 66 – 65 = 1 (ASCII value of B is 66)
a. Explain why this is or is not a good hash function.
b. What improvement(s) could be made?
2. Assume that the hash function is: f(key) = key % B
a. What is the problem if B is too small?
b. What is the problem if B is too large?
c. What is the big-0 run-time if there are n records?
d. What does the run-time for a find, insert, and delete each approach as B gets very
large?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education