Computer Science Fundamentals (CS153 2003S)

Class 48: LInear Structures

Back to Implementing Lists with Nodes. On to Priority Queues, Heaps, and Heap Sort.

Held: Friday, 25 April 2003

Summary: Today we consider a variety of linear structures, among the simplest forms of collections.

Related Pages:

Assignments:

Notes:

Overview:

About Linear Structures

Stacks

Queues

Implementation Notes

 

History

Thursday, 15 January 2003 [Samuel A. Rebelsky]

 

Back to Implementing Lists with Nodes. On to Priority Queues, Heaps, and Heap Sort.

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 Tue May 6 09:21:07 2003.
The source to the document was last modified on Thu Jan 16 15:16:16 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/outline.48.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu