Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Suppose we built a hash table for strings where the hash value (number) associated to each string is just the numeric value of its first character. (Lowercase 'a' is 97, 'b’ is 98, 'c' is 99, and so on, through 'p' at 112, 's' at 115, 'z' at 122, and on to a few special characters; numbers and capital letters are earlier in the sequence.) If we used the simplest implementation shown in class, separate chaining, where each bucket points to a possibly-empty list of values, adding the words "apple", “bag", “aardvark", and “badger" to an otherwise empty table with five buckets would give us something like this: 3 4 apple aardvark bag badger a. If we then added "snake" and "pear" to the hash table (in that order), where would they go? b. If we then increased the table size to have ten buckets, where would each of the six strings end up? c. Comment on the efficacy of just using the first letter of a string to compute its hash value.

Suppose we built a hash table for strings where the hash value (number) associated to each string is just the numeric value of its first character. (Lowercase 'a' is 97, 'b’ is 98, 'c' is 99, and so on, through 'p' at 112, 's' at 115, 'z' at 122, and on to a few special characters; numbers and capital letters are earlier in the sequence.) If we used the simplest implementation shown in class, separate chaining, where each bucket points to a possibly-empty list of values, adding the words "apple", “bag", “aardvark", and “badger" to an otherwise empty table with five buckets would give us something like this: 3 4 apple aardvark bag badger a. If we then added "snake" and "pear" to the hash table (in that order), where would they go? b. If we then increased the table size to have ten buckets, where would each of the six strings end up? c. Comment on the efficacy of just using the first letter of a string to compute its hash value.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Suppose we built a hash table for strings where the hash value (number) associated to each string is just the numeric value of its first character. (Lowercase 'a' is 97, 'b' is 98, 'c' is 99, and so on, through 'p' at 112, 's' at 115, z' at 122, and on to a few special characters; numbers and capital letters are earlier in the sequence.) If we used the simplest implementation shown in class, separate chaining, where each bucket points to a possibly-empty list of values, adding the words "apple", "bag", “aardvark", and "badger" to an otherwise empty table with five buckets would give us something like се. this: 3 аpple aardvark bag badger a. If we then added "snake" and "pear" to the hash table (in that order), where would they go? b. If we then increased the table size to have ten buckets, where would each of the six strings end up? c. Comment on the efficacy of just using the first letter of a string to compute its hash value.
Transcribed Image Text:Suppose we built a hash table for strings where the hash value (number) associated to each string is just the numeric value of its first character. (Lowercase 'a' is 97, 'b' is 98, 'c' is 99, and so on, through 'p' at 112, 's' at 115, z' at 122, and on to a few special characters; numbers and capital letters are earlier in the sequence.) If we used the simplest implementation shown in class, separate chaining, where each bucket points to a possibly-empty list of values, adding the words "apple", "bag", “aardvark", and "badger" to an otherwise empty table with five buckets would give us something like се. this: 3 аpple aardvark bag badger a. If we then added "snake" and "pear" to the hash table (in that order), where would they go? b. If we then increased the table size to have ten buckets, where would each of the six strings end up? c. Comment on the efficacy of just using the first letter of a string to compute its hash value.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS