Computer Science Fundamentals (CS153 2003S)

Class 52: Implementing Dictionaries with Hash Tables

Back to Implementing Dictionaries with Lists. On to Implementing Dictionaries with Binary Search Trees.

Held: Friday, 2 May 2003

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

Thursday, 15 January 2003 [Samuel A. Rebelsky]

 

Back to Implementing Dictionaries with Lists. 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 Tue May 6 09:21:12 2003.
The source to the document was last modified on Thu Jan 16 15:16:16 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/outline.52.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu