Chapter 27.7, Problem 27.7.1CP

Program Plan Intro

Hash Code:

• First, a hash function converts a search key to an integer value and then it compresses this hash code into an index in the hash table.
• The hash code is simply a 32-bit signed int number, where the object is managed by a hash table.
• Actually, hash code is not a unique number for an object. The two objects will return the same hash code if both the objects are equal.

Bit Shift Operators:

There are two bit shift operators: the left shift operator << and the right shift operator >>.

Syntax:

some_int << number_of_bits

some_int >> number_of_bits

where,

• some_int is an integer value or variable.
• number_of_bits is an integer value is at most 8 *.
• The left shift operator multiplies the left operand by 2 raised to the right operand power. In math notation, x << y equals x * 2^y.
• The right shift operator >> is used to divide by powers of 2.