Fund. CS II (CS152 2004F)

Class 34: Priority Queues

Back to Preparation for Exam 2. On to Project Discussion.

Held: Monday, 1 November 2004

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:

Priority queue basics

Java Detour: Abstract classes

Implementing priorty queues

Runtime Analysis

Looking ahead: Lists

Back to Preparation for Exam 2. On to Project Discussion.

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 Wed Dec 8 10:37:22 2004.
The source to the document was last modified on Thu Aug 26 20:22:23 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2004F/Outlines/outline.34.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu