Fundamentals of Computer Science II (CSC-152 99F)


Class 36: Introduction to Linear Structures

Back to Lists, Concluded. On to Stack Lab.

Held Wednesday, November 3, 1999

Overview

Today, we consider a simplification of lists, linear structures, collections which allow you to add and get elements, but little else.

Notes

Contents

Summary


Linear Structures

Detour: Naming Methods

Stacks

Queues

Priority Queues

Doubly-Ended Queues


History

Tuesday, 10 August 1999

Wednesday, 3 November 1999

Back to Lists, Concluded. On to Stack Lab.


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/99F/Outlines/outline.36.html

Source text last modified Wed Nov 3 09:51:34 1999.

This page generated on Wed Nov 3 09:54:09 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu