Options
1. INSERT - This button inserts a number entered in the text field according
to the hashing strategy chosen. If the intial location is full, then subsequent
locations are searched based on the collision resolution algorithm.
2. INSERT RANDOM - Inserts randomly generated keys.
3. DELETE - This button deletes the first copy of the given value and marks it
in blue to indicate that the slot was originally full but is now empty. (Lazy
deletion)
4. FIND - This button highlights the first location found with the given value.
5. CLEAR - This button aborts the current hash and displays a new hash
table.
6. STATUS: By clicking on any cell, you can see all the keys that wanted to be
placed in that cell. This is a great way of observing clustering patterns.
Changing Parameters
Select a Hash Function to run.
Select the Collision Resolution.
Click on Miscellaneous/Setup button.
Miscellaneous/Setup
Choose the number of buckets and slots per bucket. Check use prime to
generate the hash table with prime buckets.
Data Setup
Choose the upper limit of the data that can be inserted into the hash table,
data size and kind of data (even, odd or mixed)
Generated Data
Choose the Data Type of data to be generated (random, multiple or sequence
of some number).
After completing the setup, click onExecute button
LINKED LIST CHAINING
Try linked list as the hashing algorithm.
Select the Slots per bucket = 1.
Try inserting a variety of values (using Insert, Run or Generate).
Notice that the average number of probes is always one.
Does this mean that the search time is always one? How are they defining
"average probes"?
LINKED LIST CHAINING
Try linked list chaining as the collision resolution method.
Try inserting a variety of values.