Advertisement
Published in:
2017 | OriginalPaper | Chapter
3. Queues Using Arrays
Authors : James T. Streib, Takako Soma
Published in: Guide to Data Structures
Publisher: Springer International Publishing
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.