CSC161 2011S Imperative Problem Solving

Class 51: Building Stacks and Queues from Arrays

Back to Designing More ADTs: Stacks and Queues. On to Linked Stacks and Queues.

This outline is also available in PDF.

Held: Wednesday, 4 May 2011

Summary: We consider array-based implementations of stacks and queues.

Related Pages:

Notes:

Overview:

Back to Designing More ADTs: Stacks and Queues. On to Linked Stacks and Queues.

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 10 10:34:36 2011.
The source to the document was last modified on Wed Jan 5 12:52:14 2011.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CSC161/2011S/Outlines/outline.51.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu