Slide On QUEUE
Slide On QUEUE
On
Queues
QUEUES
• A Queue is a linear list of elements in which deletions can take place only at one end,
called the front, and insertions can take place only at the other end, called the rear.
The terms “front” and “rear” are used in describing a linear list only when it
implemented as a queue.
• Queues are also called first-in first-out (FIFO) lists, since the first element in a queue
will be the first element out of the queue. In other words, the order in which elements
enter a queue is the order in which they leave. This contrasts with stacks, which are
Last-in First-out (LIFO) lists.
Queues abound in everyday life.
For example:
• The automobiles waiting to pass through an intersection form a
queue, in which the first car in line is the first car through;
• the people waiting in line at a bank form a queue, where the first
person in line is the first person to be waited on; and so on.
• An important example of a queue in computer science occurs in a
timesharing system, in which programs with the same priority form a
queue while waiting to be executed.
• Queue for printing purposes
Basic operations that involved in Queue:
Fig. 6-15
REPRESENTATION OF QUEUE
• when an element is deleted from the queue, the value of FRONT is
increased by 1; this can be implemented by the assignment
• FRONT := FRONT + 1
• Similarly, whenever an element is added to the queue, the value of REAR is
increased by 1; this can be implemented by the assignment
• REAR := REAR + 1
• This means that after N insertions, the rear element of the queue will
occupy QUEUE[N] or, in other words, eventually the queue will occupy the
last part of the array. This occurs even through the queue itself may not
contain many elements.
REPRESENTATION OF QUEUE
QUEUE
FRONT : 1
REAR : 4
FRONT : 2
REAR : 4
FRONT : 2
REAR : 6
FRONT : 3
REAR : 6
• Suppose we want to insert an element ITEM into a queue at the time the queue does
occupy the past part of the array,
• i.e. when REAR = N. One way to do this is to simply move the entire queue to the
beginning of the array, changing FRONT and REAR accordingly, and then inserting
ITEM as above.
• Array QUEUE is circular, that is, that QUEUE[1] comes after QUEUE[N] in the array.
With this assumption, we insert ITEM into the queue by assigning ITEM to QUEUE[1].
Specifically, instead of increasing REAR to N+1, we reset REAR=1 and then assign
QUEUE[REAR] := ITEM
• Similarly, if FRONT = N and an element of QUEUE is deleted, we reset FRONT = 1
instead of increasing FRONT to N + 1.
• Suppose that our queue contains only one element, i.e., suppose that
• FRONT = REAR = NULL
• And suppose that the element is deleted. Then we assign
• FRONT := NULL and REAR := NULL To indicate that
the queue is empty.
Example
Figure 6-17 shows how a queue may be maintained by a circular array QUEUE with N = 5
memory locations. Observe that the queue always occupies consecutive locations except
when it occupies locations at the beginning and at the end of the array. If the queue is
viewed as a circular array, this means that is still occupies consecutive locations. Also, as
indicated by fig. 6-17(m), the queue will be empty only when FRONT = REAR and an
elements is deleted. For this reason, NULL is assigned to FRONT and REAR in fig. 6-
17(m).
QUEUE
(a) Initially empty : FRONT : 0
REAR : 0
1 2 3 4 5
(b) A, B and then C inserted: FRONT : 1 A B C
REAR : 3
B C
(C) A deleted : FRONT : 2
REAR : 3
(d) D and then E inserted : FRONT : 2 B C D E
REAR : 5
Example QUEUE
(e) B and C deleted : FRONT : 4 D E
REAR : 5
1 2 3 4 5
(f) F inserted : FRONT : 4 F D E
REAR : 1
Fig :6.17
QINSERT
QINSERT(QUEUE,N,FRONT,REAR,ITEM)
This procedure inserts an element ITEM into a queue.
ITEM.QDELETE(QUEUE,N,FRONT,REAR,ITEM)
This procedure deletes an element from the queue and assigns it to the
variable
• [Queue already empty]
If FRONT=NULL, then Write: Underflow, and Return.
2. Set ITEM=QUEUE[FRONT]
3. [Find new value of FRONT]
If FRONT=REAR, then [Queue has only one element to start]
Set FRONT=NULL and REAR=NULL
Else if FRONT =N then
Set FRONT =1
Else Set FRONT = FRONT +1
[End of if structure]
4. Return
Deque
• The mathematical model of a Deque (usually pronounced like "deck") is
an irregular acronym (Operation) of double-ended queue.
• Double-ended queues are a kind of sequence containers.
• Elements can be efficiently added and removed from any of its ends
(either the beginning or the end of the sequence).
• The model allows data to be entered and withdrawn from the front
and rear of the data structure.
Deques
• Insertions and deletions can occur at either end but not in the middle
• Implementation is similar to that for queues
• Deques are not heavily used
• You should know what a deque is, but we won’t explore them much further
Double-Ended-QUE
– An element with higher priority will be processed before any element with
lower priority.
– Two elements with the same priority will be processed in order in which they
are add to the queue.