edited by
2,901 views

3 Answers

Best answer
1 votes
1 votes

Algorithm For Insertion in Circular Queue

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

So option A

selected by
Answer:

Related questions

0 votes
0 votes
2 answers
1
rishu_darkshadow asked Sep 26, 2017
1,228 views
In a heap, every element is ___________ of all the elements in the subtree.maximum minimum sum product
1 votes
1 votes
3 answers
2
rishu_darkshadow asked Sep 25, 2017
3,759 views
The total number of spanning trees that can be drawn using five labeled vertices is:125 64 36 16