Abstract
Like the stack, the queue is an important data structure based upon the list data model. A common use of queues is to hold data requiring processing until a service provider is able to process it. Data for each new request enters the queue at its rear and waits until data in front of it has been processed and removed from the front of the queue. When it reaches the front of the queue, it too is processed and removed from the front queue. Queues are also known as “FIFO” (First-In First-Out) lists [Aho and Ullman, 1995, page 318].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Langdon, W.B. (1998). Evolving a Queue. In: Genetic Programming and Data Structures. The Springer International Series in Engineering and Computer Science, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5731-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5731-9_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7625-5
Online ISBN: 978-1-4615-5731-9
eBook Packages: Springer Book Archive