PREV INDEX NEXT

Author: Unknown
Subject: Hash Function clarifications
Date: Tuesday, 03 Nov 2020, 02:04:30

1. What is CHAR_BIT? Is it the last bit in the value of CHAR?

2. Not sure if I am missing something, but why does SIZE need to be odd? How can we guarantee that the number of chains is odd? Can't it be 0 if there are no hash collisions?

3. Is the value returned by the hash function guaranteed to be less than the size of the table? If not, does this mean we need another mod by the size of the table to use it as an index?
PREV INDEX NEXT