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


Class 34: Linked Lists

Back to Discussion of Exam 2. On to Adding Elements to Linked Lists.

Held Tuesday, April 4, 2000

Overview

Today we consider how to implement Simple Lists using the Cons Cells that underlie Scheme Lists.

Notes

Contents

Summary


Review: What is a List?

Some Variations in Array-Based Lists

Resizing Array-Based Lists

Gaps in the Array

Implementing Other Lists with Scheme Lists


History

Tuesday, 18 January 2000

Wednesday, 5 April 2000

Back to Discussion of Exam 2. On to Adding Elements to Linked 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.34.html

Source text last modified Wed Apr 5 09:06:40 2000.

This page generated on Fri Apr 7 09:55:19 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu