Robert Bosch Hash Tables Quiz 4

Explanation:

Option D is the answer, this formula is used to know if the blocking factor, loading factor, and file buckets are known while using linear hash

Explanation:

When several elements compete for the same bucket in the hash table it is called collision

Explanation:

Average chain length is the load factor.

Explanation:

Quicker access to the elements distinguishes a hash table from a linked list

Explanation:

Load factor = (no. of elements)/ (number of slots) = 1000/20 = 50

Explanation:

The key is hashed twice; first by hashCode() of Object class and then by internal hashing method of HashMap class.

 

Explanation:

Hashmap outputs in the order of hashcode of the keys. So it is unordered but will always have same result for same set of keys.

Explanation:

Collection interface provides add, remove, search or iterate while map has clear, get, put, remove, etc.
Map interface is the HashMap. It is a hash table based implementation of the Map interface. It implements all of the Map operations and allows null values and one null key. Also, this class does not maintain any order among its elements.

Explanation:

Vector implements AbstractList which internally implements Collection. Others come from implementing the Map interface.

 

Explanation:

IdentityHashMap is rarely used as it violates the basic contract of implementing equals() and hashcode() method.