Question

Assume that a HashTable has been initialized with the code below, where the defualt constructor is the number of places in the HashTable.

HashTable myHashTable = new new HashTable<MyObject>(50);

Write the hashCode function that would generate appropriate HashCodes, keeping collisions to a minimum.

Assume the MyObject class has the following properties:

private String myName;

private int myAge;

private String favoriteColor;

private int birthYear;

private int birthMonth;

private int birthDay;

private int hashSize;

private String favoriteMeal;

Answer 1

GIVEN THAT :  

The default constructor is the number of places in the hashtable

public int hashCode() {

final int prime = 31;

int result =1;

result = prime * result + birthDay;

result = prime * result + birthMonth;

result = prime * result + birthYear;

result=prime * result + ((favouritecolour = = null) ? 0: favouriteColour.hashCode());

result = prime * result + ((favouriteMeal = = null) ? 0: favouriteMeal.hashCode());

result = prime * result + hashSize;

result = prime * result + myAge;

result = prime * result + ((myName = = null) ? 0 : myName.hashCode());

result result;

hence proved.

for any query please leave ur drop ur valuable comment in comment box