Skip to main content

Part of the book series: Springer Compass International ((COMPASS))

  • 39 Accesses

Abstract

This chapter presents the specifications for both the Queue and Deque (pronounced ‘deck’) abstractions, since the two abstractions are so similar.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983, pp. 37–53.

    MATH  Google Scholar 

  2. J. Bentley, Programming Pearls, Addison-Wesley, Reading, MA 1986.

    Google Scholar 

  3. G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.

    Google Scholar 

  4. K. Christian, A Guide to Modula-2, Springer-Verlag, New York, NY 1986.

    MATH  Google Scholar 

  5. G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, London, England 1984.

    Google Scholar 

  6. D. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.

    Google Scholar 

  7. B. Liskov and J. Guttag, Abstraction and Specification in Program Development, The MIT Press, Cambridge, MA 1986.

    MATH  Google Scholar 

  8. J. Moore and K. McKay, Modula-2 Text and Reference, Prentice-Hall, Engle- wood Cliffs, NJ 1987.

    Google Scholar 

  9. J. W. Ogilvie, Modula-2 Programming, McGraw-Hill, New York, NY 1985.

    Google Scholar 

  10. A. Sale, Modula-2 Discipline and Design, Addison-Wesley, Wokingham, England, 1986.

    Google Scholar 

  11. H. Schildt, Modula-2 Made Easy, Osborne McGraw-Hill, Berkeley, CA 1986.

    Google Scholar 

  12. T. Standish, Data Structure Techniques, Addison-Wesley, Reading, MA 1980, pp. 185–246.

    Google Scholar 

  13. A. Tenenbaum and M. Augenstein, Data Structures Using Pascal, Prentice-Hall, Englewood Cliffs, NJ 1981.

    MATH  Google Scholar 

  14. R. Wiener and G. Ford, Modula-2 A Software Development Approach, John Wiley & Sons, New York, NY 1985.

    Google Scholar 

  15. 15]R. Wiener and R. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986.

    Google Scholar 

  16. N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986, pp. 180–195.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Lins, C. (1989). The Queue and Deque Abstractions. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6396-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-6396-5_10

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-6398-9

  • Online ISBN: 978-1-4684-6396-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics