Scribd
Upload
30 views

Queue (Abstract Data Type) : From Wikipedia, The Free Encyclopedia

A queue is an abstract data structure where entities are kept in order. New entities are added to the rear of the queue (enqueue) and existing entities are removed from the front (dequeue), making it a First-In-First-Out (FIFO) structure. Queues provide buffering in computer science, transport, and operations research by temporarily storing entities to be processed later. They are commonly implemented using data structures like circular buffers and linked lists.

Uploaded by

elasu85
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views

Queue (Abstract Data Type) : From Wikipedia, The Free Encyclopedia

A queue is an abstract data structure where entities are kept in order. New entities are added to the rear of the queue (enqueue) and existing entities are removed from the front (dequeue), making it a First-In-First-Out (FIFO) structure. Queues provide buffering in computer science, transport, and operations research by temporarily storing entities to be processed later. They are commonly implemented using data structures like circular buffers and linked lists.

Uploaded by

elasu85
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Queue (abstract data type)

From Wikipedia, the free encyclopedia

This article includes a list of references, related reading or external links, but its sources rem
unclear because it lacks inline citations. Please improvethis article by introducing more
precise citations. (January 2014)

Representation of a FIFO (first in, first out) queue

In computer science, a queue (/kju/ KEW) is a particular kind of abstract data type or collection in
which the entities in the collection are kept in order and the principal (or only) operations on the
collection are the addition of entities to the rear terminal position, known as enqueue, and removal of
entities from the front terminal position, known as dequeue. This makes the queue a First-In-FirstOut (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the
first one to be removed. This is equivalent to the requirement that once a new element is added, all
elements that were added before have to be removed before the new element can be removed.
Often a peek or front operation is also entered, returning the value of the front element without
dequeuing it. A queue is an example of a linear data structure, or more abstractly a sequential
collection.
Queues provide services in computer science, transport, and operations research where various
entities such as data, objects, persons, or events are stored and held to be processed later. In these
contexts, the queue performs the function of a buffer.
Queues are common in computer programs, where they are implemented as data structures coupled
with access routines, as an abstract data structure or in object-oriented languages as classes.
Common implementations are circular buffers and linked lists.

You might also like