1. Hashing related: Suppose a letter's integer value is determined by the following table: A B...

 

Transcribed Image Text:

1. Hashing related: Suppose a letter's integer value is determined by the following table: A B C E F G H I J K L M 1 2 3 4 5 6 7 8 9 10 11 12 13 N O P Q R S T U V W X Y Z 14 15 16 17 18 19 20 21 22 23 24 25 26 Draw the hash table after inserting the following keys. The table does not allow duplicates. A NEW DAY IS COMING 1) Use separate chaining Hash function is h (C) = Ord (C) % 7. 2) Use linear probing (for the first eleven keys) Hash function is h (C) = Ord (C) % 11. 1. Hashing related: Suppose a letter's integer value is determined by the following table: A B C E F G H I J K L M 1 2 3 4 5 6 7 8 9 10 11 12 13 N O P Q R S T U V W X Y Z 14 15 16 17 18 19 20 21 22 23 24 25 26 Draw the hash table after inserting the following keys. The table does not allow duplicates. A NEW DAY IS COMING 1) Use separate chaining Hash function is h (C) = Ord (C) % 7. 2) Use linear probing (for the first eleven keys) Hash function is h (C) = Ord (C) % 11.