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


Class 37: Introduction to Linear Structures

Back to Linked Lists, Concluded. On to Implementing Stacks and Queues.

Held Monday, April 10, 2000

Overview

Today we move on to a new class of data structures, the so-called linear structures.

Notes

Contents

Summary


Linear Structures

Detour: Naming Methods

Stacks

Queues

Priority Queues

Doubly-Ended Queues


History

Tuesday, 18 January 2000

Friday, 7 April 2000

Monday, 10 April 2000

Back to Linked Lists, Concluded. On to Implementing Stacks and Queues.


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.37.html

Source text last modified Mon Apr 10 09:55:01 2000.

This page generated on Tue Apr 11 09:41:20 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu