Fund. CS II (CS152 2006S)

Class 31: Priority Queues

Back to Discussion of Exam 1. On to Heaps and Heap Sort.

Held: Wednesday, March 15, 2006

Summary: Today we investigate priority queues, linear structures in which the policy is highest-priority first, which usually translates into smallest first.

Related Pages:

Assignments

Notes:

Overview:

Philosophy of Priority Queues

Applications of Priority Queues

Priority Queue Methods

Implementing priorty queues

Back to Discussion of Exam 1. On to 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 9 08:31:44 2006.
The source to the document was last modified on Thu Jan 12 14:58:06 2006.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2006S/Outlines/outline.31.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu