Each address generated
by a hashing function corresponds to a page, or bucket, with slots for multiple
records. Within a bucket, records are placed in order of arrival. When the
same address is generated for two or more records, a collision is said to have