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


Class 30: Introduction to Lists

Back to Introduction to Data Structures. On to Implementing Lists.

Held Tuesday, March 14, 2000

Overview

Today we begin to consider one of the key ADTs: the list ADT. We investigate a number of perspectives on what a list is and start to think about which set of operations is preferable.

Notes

Contents

Summary


Perspectives on ADTs and Data Structures

Lists

Scheme-Like Lists

Lists as Collections

Kinds of Lists

Lists vs. Arrays

Design Issues


History

Tuesday, 18 January 2000

Tuesday, 14 March 2000

Back to Introduction to Data Structures. On to Implementing Lists.


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/2000S/Outlines/outline.30.html

Source text last modified Wed Mar 15 09:23:26 2000.

This page generated on Wed Mar 15 09:41:53 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu