Correct Answer : Simple Hash
Explanation : Masking off the bottom m bits to use as an index into a table of size 2 m is a basic hash function. A folding hash code is created by dividing the input into n pieces of m bits each, where 2m is the table size, then combining the sections with a parity-preserving bitwise operation like ADD or XOR.
