Queues
(Chapter 5)
,Outline
Introduction
Operations on queues
Queue implementation
Implementation of insert and delete operations on a queue
Limitations of linear queues
Circular queues
Operations on circular queues
Implementation of insert and delete operations on a circular queue
Other types of queues
Priority queues
Deques
Applications
ADT for queues
,
A Queue is a linear list in which all insertions are made
at one end of the list known as rear or tail of the queue
and all deletions are made at the other end known as
front or head of the queue.
An insertion operation is also referred to as enqueuing a
queue and a deletion operation is referred to as
dequeuing a queue.
a queue data structure obeys the principle of first in first
out (FIFO) or first come first served (FCFS)
(Chapter 5)
,Outline
Introduction
Operations on queues
Queue implementation
Implementation of insert and delete operations on a queue
Limitations of linear queues
Circular queues
Operations on circular queues
Implementation of insert and delete operations on a circular queue
Other types of queues
Priority queues
Deques
Applications
ADT for queues
,
A Queue is a linear list in which all insertions are made
at one end of the list known as rear or tail of the queue
and all deletions are made at the other end known as
front or head of the queue.
An insertion operation is also referred to as enqueuing a
queue and a deletion operation is referred to as
dequeuing a queue.
a queue data structure obeys the principle of first in first
out (FIFO) or first come first served (FCFS)
