A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
(a) Rear = MAX_SIZE – 1
(b) Front = (rear + 1)mod MAX_SIZE
(c) Front = rear + 1
(d) Rear = front
Question is taken from Queue Operations topic in division Abstract Data Types of Data Structures & Algorithms I
The question was posed to me in my homework.