1. Rehashing resolves a collision by computing a new hash location using a previous hash location as an input.

True

False

2The following is an example of a rehash function:

(hashValue + 4) % 50

True

False

3 Random probing resolves collisions by generating pseudo-random hash values.

True

False

4 A chain is made from a linked list.

True

False

5 A collection of elements stored at a particular hash location is called a

		pale
		link
		array
		bucket

C++ Thanks