C++ Program to Implement Circular Queue Operations (Algorithm)
AIM:
Write a program to implement circular queue operations.
ALGORITHM:
INSERT()
Step 1: If REAR = SIZE-1 then
REAR = 0
Else
REAR=REAR + 1
Step 2: If FRONT = REAR then
Write (“Circular Queue Overflow”)
Step 3: CQ[REAR]=X
Step 4: If FRONT = -1 then
FRONT=0
DELETE()
Step 1: If FRONT = -1 then
Write (“Circular Queue Underflow”)
Step 2: Return (CQ [FRONT])
Step 3: If FRONT = REAR then
FRONT=REAR=-1
Step 4: If FRONT = SIZE-1 then
FRONT=0
Else
FRONT=FRONT+1