Enqueue operation
Enqueue(queue, n, front, rear,
item)//inserts item into a queue
1. [queue already filled?]
If front := 1 and rear := n or
front := rear +1 then:
Print OVERFLOW and return
2. [find new value of rear]
If front : =NULL , then [Q
initially empty]
Set front := 1 and rear := 1;
Else if rear := n then
set rear := 1;
Else set rear : = rear + 1;
3. Set queue [rear]:= item [inserts new element].
4. Return;
DE queue
Operation
Dequeue(queue, n, front, rear,
item)
variable item.
1. [Queue already empty?]
If front := NULL then : print
UNDERFLOW and return.
2. Set item : = queue[front].
3. [find new value of front]
If front=rear then, [queue has
only one element]
Set front=rear=NULL;
Else if front=n then : set
front := 1;
Else set front : = front +1;
4. Return.
