Fundamentals of Computer Science I (CS151.02 2007S)

Class 42: Association Lists and Searching

Back to Higher-Order Procedures, Summarized. On to Binary Search.

This outline is also available in PDF.

Held: Tuesday, April 17, 2007

Summary: Today we visit a database-like application of Scheme, Association lists. Association lists allow you to associate information with a key and then look up the value by the key.

Related Pages:




Simple Database Problems

Association Lists

Searching in Association Lists

Variants of Association Lists


Back to Higher-Order Procedures, Summarized. On to Binary Search.

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 Thu Sep 13 20:54:52 2007.
The source to the document was last modified on Fri Apr 13 08:22:43 2007.
This document may be found at

You may wish to validate this document's HTML ; Valid CSS! ; Creative Commons License

Samuel A. Rebelsky,

Copyright © 2007 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.