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


Outline of Class 37: Stacks and Queues

Held: Wednesday, April 8, 1998


Linear Structures

Stacks

Implementing Stacks

Using Stacks: Reverse Polish Notation

Queues

Doubly-Ended Queues


On to Iterators and Puzzles
Back to Other Machine-Level Issues
Outlines: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
Current position in syllabus


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/98S/home/rebelsky/public_html/Courses/CS152/98S/Outlines/outline.37.html

Source text last modified Tue Jan 12 11:52:28 1999.

This page generated on Mon Jan 25 09:49:43 1999 by SiteWeaver. Validate this page.

Contact our webmaster at rebelsky@math.grin.edu