Computer Science Fundamentals (CS153 2003S)

Class 50: The Dictionary ADT

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

Held: Tuesday, 29 April 2003

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

 

History

Thursday, 15 January 2003 [Samuel A. Rebelsky]

 

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

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:10 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.50.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu