Bounded Priority Queue

  • Charles Lins
Part of the Springer Compass International book series (COMPASS)


Two different implementations of the bounded priority queue are given in this chapter. The first is a simple extension to the basic bounded queue of chapter 10 that allows an item’s priority to dictate the ordering of its arrival. This is covered in sections 12.1 and 12.2. In the second implementation, section 12.3, the structural ordering of items follows different rules; specifically those imposing a heap structure on the array of items.


Priority Queue Procedure Parameter Head Record Iterator Revision Bound Priority 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983.MATHGoogle Scholar
  2. [2]
    J. Bentley, Programming Pearls, Addison-Wesley, Reading, MA 1986.Google Scholar
  3. [3]
    G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.Google Scholar
  4. [4]
    K. Christian, A Guide to Modula-2, Springer-Verlag, New York, NY 1986.MATHGoogle Scholar
  5. [5]
    G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, London England, 1984.Google Scholar
  6. [6]
    D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.Google Scholar
  7. [7]
    B. Liskov and J. Guttag, Abstraction and Specification in Program Development, The MIT Press, Cambridge, MA 1986.MATHGoogle Scholar
  8. [8]
    J.J. Martin, Data Types and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.MATHGoogle Scholar
  9. [9]
    T.A. Standish, Data Structure Techniques, Addison-Wesley, Reading, MA 1980.Google Scholar
  10. [10]
    R. Wiener and G. Ford, Modula-2 A Software Development Approach, John Wiley & Sons, New York, NY 1985.Google Scholar
  11. [11]
    R. Wiener and R. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986.Google Scholar
  12. [12]
    N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.MATHGoogle Scholar
  13. [13]
    N. Wirth, Programming in Modula-2, 3rd. corrected edition, Springer-Verlag, New York, NY 1985.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Charles Lins
    • 1
  1. 1.Apple Computer, Inc.CupertinoUSA

Personalised recommendations