For this question, you need to provide your handwritten answer on the given answer sheet. A....
For this question, you need to provide your handwritten answer on the given answer sheet. A. Explain the Collision term in a Hash Table. B. Use the following hash function to build a hash table of array size (12) hashFunction(s) s s.toUpperCase(); ( 'A' hash (s. charAt(2) s.charAtC0) ) / 2 - 'A' ) MOD 12 return hash Use the hash function and the table below to build insert the following strings in the hash table using separate hash chaining mechanism to avoid colision: 'alabama', 'alaska', 'colorado', 'florida', 'indiana', 'minnesota', 'te xas', 'ohio', 'montana', 'maryland', 'kentucky', 'tennessee', 'nevada' 'georgia', 'utah' A BCD EFGH K LMN OP QRSTU VWX|Y | Z Char 86 87 88 89 90 Decimal 65 66 6768|6970717273 74 7576|7778|7980 818283 84|8 C. In comparison between Separate chaining and Linear Probing, briefly explain with your own words which collision handling mechanism is better in terms of searching for an element in the hash table.
For this question, you need to provide your handwritten answer on the given answer sheet. A. Explain the Collision term in a Hash Table. B. Use the following hash function to build a hash table of array size (12) hashFunction(s) s s.toUpperCase(); ( 'A' hash (s. charAt(2) s.charAtC0) ) / 2 - 'A' ) MOD 12 return hash Use the hash function and the table below to build insert the following strings in the hash table using separate hash chaining mechanism to avoid colision: 'alabama', 'alaska', 'colorado', 'florida', 'indiana', 'minnesota', 'te xas', 'ohio', 'montana', 'maryland', 'kentucky', 'tennessee', 'nevada' 'georgia', 'utah' A BCD EFGH K LMN OP QRSTU VWX|Y | Z Char 86 87 88 89 90 Decimal 65 66 6768|6970717273 74 7576|7778|7980 818283 84|8 C. In comparison between Separate chaining and Linear Probing, briefly explain with your own words which collision handling mechanism is better in terms of searching for an element in the hash table.