PROCEDURE CQDELETE(QUEUE, F, R, item,N)
[Deletes ‘item’ from the ‘queue’, ‘F’ is the Front end pointer and ‘R’ is the rare end pointer and ‘N’ is the number of elements in queue]

1. [Underflow ?]

if (F = 0)
write Stack is empty.
return.

2. [Insert element]

QUEUE [R] <-- item

3. [Checking for empty queue]

if (F = R)
then F <-- R <-- 0
return(item).

4. [Setting the front pointer]

if (F = N)
then F <-- 1
F <-- F + 1
return (item).