There is no negative marking
Full: (REAR+1) mod n = = FRONT, empty: (FRONT+1) mod n == REAR
Full: REAR == FRONT, empty: (REAR+1) mod n = = FRONT
Full: (FRONT+1) mod n = = REAR, empty: FRONT= =REAR=-1
Full: (REAR+1) mod n = = FRONT, empty: REAR = = FRONT= -1
3 deletion and 4 additions
4 deletion and 3 additions
4 deletion and 5 additions
None
FIFO queue
Deque
Decreasing order priority queue
Increasing order priority queue
Rear=(Rear%1)+MAX_SIZE
Rear=Rear%(MAX_SIZE+1)
Rear=(Rear+1)%MAX_SIZE
Rear=Rear+(1%MAX_SIZE)
Ordinary Array for Each Priority and Linked List
Linked List and Ordinary Array for Each Priority
Circular Array for Each Priority and Linked List
Linked List and Circular Array for Each Priority
Front=Rear= -1
Front=(Rear+1)%MAX_SIZE
Rear=Front+1
Rear=(Front+1)%MAX_SIZE
Only front pointer
Only rear pointer
Both front and rear pointer
None of the front and rear pointer
Leaves the queue Q unchanged
Reverse the order of elements in the queue Q
Deletes the element at the front of the queue Q and inserts it at the rear keeping the other elements in the same order
Empties the queue Q
FRONT = 8 and REAR = 0
FRONT = 8 and REAR = 1
FRONT = 7 and REAR = 0
FRONT = 7 and REAR = 9
LEFT = 1 and RIGHT = 5
LEFT = 2 and RIGHT = 6
LEFT = 0 and RIGHT = 6
None
Wait!
Here's an interesting quiz for you.