Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik

Also called a map, a lookup table, an associative array, or a dictionary. Also called a map, a lookup table, an associative array, or a dictionary. It works like an array except that the index variable need not be an integer. It works like an array except that the index variable need not be an integer. Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik

Save items in a key-indexed table (index is a function of the key). Save items in a key-indexed table (index is a function of the key). Hash function: Method for computing table index from key. Hash function: Method for computing table index from key. Collision resolution: Algorithm and data structure to handle two keys that hash to the same index. Collision resolution: Algorithm and data structure to handle two keys that hash to the same index.

Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik Every object in Java is given an intrinsic hash code, which is computed from the actual hard data stored in the object. Every object in Java is given an intrinsic hash code, which is computed from the actual hard data stored in the object. The Object.hashCode() method returns that code for each object. The Object.hashCode() method returns that code for each object. The implementation of hashCode() for an object must be consistent with equals(). The implementation of hashCode() for an object must be consistent with equals().

Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik Probing: when a new key collides, find next empty slot, and put it there. Probing: when a new key collides, find next empty slot, and put it there. Separate chaining: put keys that collide in a list associated with index. Separate chaining: put keys that collide in a list associated with index.

Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik

f(i) = i

Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik

f(i) = i 2

Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik

Two or more keys to be inserted hash to the same index Two or more keys to be inserted hash to the same index For each of the M array indices, a linked list of the key-value pairs whose keys hash to that index For each of the M array indices, a linked list of the key-value pairs whose keys hash to that index Two-step searching process: hash to find the list that could contain the key, then sequentially search through that list for the key. Two-step searching process: hash to find the list that could contain the key, then sequentially search through that list for the key.

Author: Takdir, S.ST. © Sekolah Tinggi Ilmu Statistik