Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
(A)
Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
(B)
Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR
(C)
Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT
(D)
Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!