We have implemented a circular queue(capacity: (n 1)) using an array of size n.

Assume that the insertion and deletion operation using REAR and FRONT as array index, respectively.

Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are (choose one):

		Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR
		Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
		Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT
		Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT