Abstract
Unlike stacks where items can only be pushed or popped from the top, a queue has two access points and can only have items added at the rear called enqueue or removed from the front called dequeue. A queue is known as a first-in, first-out or FIFO data structure and is implemented using arrays. A queue is used to simulate a simple scheduler in an operating system in the complete program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Streib, J.T., Soma, T. (2017). Queues Using Arrays. In: Guide to Data Structures. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70085-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-70085-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70083-0
Online ISBN: 978-3-319-70085-4
eBook Packages: Computer ScienceComputer Science (R0)