Skip to main content
  • 31 Accesses

Abstract

In section 6.5 we met the idea of a queue. This was described as a FIFO structure, in that the first item to enter the queue was the first to be taken from it. The contrasting structure to this is the stack, for this is a FILO data structure. Thus, the first item on the stack is the last to be taken from it; and conversely, the last item on the stack is the first to be taken from it.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1984 Ian Birnbaum

About this chapter

Cite this chapter

Birnbaum, I. (1984). The Stack: Subroutines and Interrupts. In: Assembly Language Programming for the BBC Microcomputer. Palgrave, London. https://doi.org/10.1007/978-1-349-07360-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-07360-3_9

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-37096-4

  • Online ISBN: 978-1-349-07360-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics