Suppose we have a separate chaining hash table as given in the figure below, where the hash function is h(K) = K mod 12. Fill in your answers with a single integer (e.g. 6) or a decimal number (e.g. 6.5) with NO spaces before or after.Note: checking a Null value/empty cell is not counted as a key comparion.
a) Themaximumnumber ofkey comparisonsfor asuccessfulsearch is.
b) After inserting in the table three more keys 53, 34, and 89, theaveragenumber ofkey comparisonsrequired for asuccessfulsearch is.c) If we use an open address hashingwithlinear probingto construct a hash table for the sequence of keys 37, 39, 41, 54, 92, 77, 65, 42 (in the given order) using the same hash function h(K) = K mod 12, thelargestnumber ofkey comparisonsin anunsuccessfulsearch in this table is; if we delete the key 54 from this hash table, then thenumber ofkey comparisonsrequired to find 65 will be.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here