title: How do HashTables deal with collisions?
body: <p>I've heard in my degree classes that a <code>HashTable</code> will place a new entry into the 'next available' bucket if the new Key entry collides with another.</p>
  
  <p>How would the <code>HashTable</code> still return the correct Value if this collision occurs when calling for one back with the collision key?</p>
  
  <p>I'm assuming that the <code>Keys</code> are <code>String</code> type and the <code>hashCode()</code> returns the default generated by say Java.</p>
  
  <p>If I implement my own hashing function and use it as part of a look-up table (i.e. a <code>HashMap</code> or <code>Dictionary</code>), what strategies exist for dealing with collisions?</p>
  
  <p>I've even seen notes relating to prime numbers! Information not so clear from Google search.</p>