Start with an empty hash table of capacity 10 and load factor .75 • Double the table capacity during a resize operation. • The hash function maps String keys to indexes using the first character base 26 mod table size. • Example: "Wilson" • Use quadratic probing to resolve collisions. Ex. h(n), h(n) + 1², h(n) + 2?, h(n) + 3² + ... (mod table 22 mod 10 = 2 size) • Show the final table after adding the following in this order: "Schmitt", "Cernan", "Duke", "Young", "Irwin", "Scott", "Mitchell", "Shepard", "Bean", "Conrad", "Aldrin", "Armstrong" For your convenience here are character/number mappings: в с D E F G нI кLм 5 6 7 8 9 1 2 3 4 10 11 12 O P Q R S IU v w x Y Z 13 14 15 16 17 18 19 20 21 22 23 24 25

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

Please draw the hashtable

• Start with an empty hash table of capacity 10 and load factor .75
• Double the table capacity during a resize operation.
• The hash function maps String keys to indexes using the first character base 26 mod table size.
• Example: "Wilson"
• Use quadratic probing to resolve collisions. Ex. h(n), h(n) + 1?, h(n) + 2², h(n) + 3² + .. (mod table
22 mod 10 = 2
size)
• Show the final table after adding the following in this order: "Schmitt", "Cernan", "Duke",
"Young", "Irwin", "Scott", "Mitchell", "Shepard", "Bean", "Conrad", "Aldrin", “Armstrong"
For your convenience here are character/number mappings:
А в с D E F G н I
JK L M
0 1
3
4 5 6 7 8
9
10
11
12
N o P QR ST U V
w x Y Z
13
14
15
16
17
18
19
20
21
22
23
24
25
Transcribed Image Text:• Start with an empty hash table of capacity 10 and load factor .75 • Double the table capacity during a resize operation. • The hash function maps String keys to indexes using the first character base 26 mod table size. • Example: "Wilson" • Use quadratic probing to resolve collisions. Ex. h(n), h(n) + 1?, h(n) + 2², h(n) + 3² + .. (mod table 22 mod 10 = 2 size) • Show the final table after adding the following in this order: "Schmitt", "Cernan", "Duke", "Young", "Irwin", "Scott", "Mitchell", "Shepard", "Bean", "Conrad", "Aldrin", “Armstrong" For your convenience here are character/number mappings: А в с D E F G н I JK L M 0 1 3 4 5 6 7 8 9 10 11 12 N o P QR ST U V w x Y Z 13 14 15 16 17 18 19 20 21 22 23 24 25
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

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