Computer Science Fundamentals (CS153 2004S)

Class 52: Implementing Dictionaries with Hash Tables

Back to The Dictionary ADT. On to Implementing Dictionaries with Binary Search Trees.

Held: Monday, 3 May 2004

Summary: Today we consider one of the most important implementations of dictionaries, Hash tables.

Related Pages:

Notes:

Overview:

Hash Tables

Hash Functions

An Exercise in Hashing

Hashing in Java

Handling Conflicting Keys

Removing Elements from Hash Tables

 

History

 

Back to The Dictionary ADT. On to Implementing Dictionaries with Binary Search Trees.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Fri May 7 09:43:36 2004.
The source to the document was last modified on Tue Jan 13 10:26:12 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.52.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu