Fundamentals of Computer Science II (CSC-152 99F)


Class 42: Hash Tables

Back to Search Trees. On to Introduction to Trees.

Held Friday, November 12, 1999

Overview

Today, we'll consider another (and somewhat different) implementation of dictionaries: the hash table. Hash tables usually provide O(1) get and put operations.

Notes

Contents

Summary

Handouts


Detour: The Options Group

Hash Tables

Hash Functions

An Exercise in Hashing

Handling Collisions

Hashing in Java

Removing Elements from Hash Tables


History

Tuesday, 10 August 1999

Wednesday, 10 November 1999

Friday, 12 November 1999

Back to Search Trees. On to Introduction to Trees.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Outlines/outline.42.html

Source text last modified Fri Nov 12 08:39:17 1999.

This page generated on Fri Nov 12 08:43:15 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu