Algorithms and OOD (CSC 207 2014F) : Outlines

Outline 45: Implementing Dictionaries with Hash Tables


Held: Friday, 21 November 2014

Back to Outline 44 - Tree Traversal. On to Outline 46 - Hash Tables, Continued.

Summary

We consider an essential implemntation of the Dictionary ADT - Hash tables. Hash tables provide such a common implementation that many programmers often refer to dictionaries as "hashes".

Related Pages

Overview

Administrivia

Upcoming Work

Fun Things

Extra Credit

Academic

Peer Support

Miscellaneous

Hash Tables

Hash Functions

An Exercise in Hashing

A: 1   F: 6   K: 11  P: 16  U: 21  Z: 26
B: 2   G: 7   L: 12  Q: 17  V: 22
C: 3   H: 8   M: 13  R: 18  W: 23
D: 4   I: 9   N: 14  S: 19  X: 24
E: 5   J: 10  O: 15  T: 20  Y: 25

Hashing in Java

Handling Conflicting Keys

Removing Elements from Hash Tables