Computer Science Fundamentals (CS153 2004S)

Class 51: The Dictionary ADT

Back to Priority Queues, Heaps, and Heap Sort. On to Implementing Dictionaries with Hash Tables.

Held: Friday, 30 April 2004

Summary: Today we consider another central ADT, the Dictionary. Dictionaries are, in effect, arrays indexed by arbitrary values.

Related Pages:

Notes:

Overview:

An Introduction to Dictionaries

Applications of Dictionaries

Dictionaries, Revisited

Dictionaries vs. Databases

Implementing Dictionaries with Association Lists

Binary Search Trees

 

History

 

Back to Priority Queues, Heaps, and Heap Sort. On to Implementing Dictionaries with Hash Tables.

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:35 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.51.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu