Fund. CS II (CS152 2004F)

Homework 33: Implementing Priority Queues

Due: Friday, 29 October 2004

As you learned in class, a Priority Queue is a linear structure in which the get method returns the smallest value (as determined by the compareTo method or a Comparator).

In a paragraph or two, explain how you might implement priority queues. You should not write Java code. Rather, give the general structure to your solution.

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:36:56 2004.
The source to the document was last modified on Wed Oct 27 10:04:46 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2004F/Homework/33.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu