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

Class 51: Hash Tables

Back to Binary Search Trees. On to No Class.

Held Wednesday, November 29, 2000


Today we visit yet another implementation of dictionaries: hash tables. Hash tables are interesting in that they provide operations that are likely to have O(1) time.



Hash Tables

Hash Functions

An Exercise in Hashing

Hashing in Java

Removing Elements from Hash Tables


Wednesday, 23 August 2000

Thursday, 24 August 2000

Tuesday, 28 November 2000

Back to Binary Search Trees. On to No Class.

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

Source text last modified Tue Nov 28 09:38:42 2000.

This page generated on Tue Nov 28 09:43:29 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at