subject: Data Structures and Algorithms

Q3. (Points 2+2+2+2+2) Suppose data is inserted in a circular queue (array implementation). Write the condition(s) and corresponding action (rear and front) for following. Don't write the whole algorithm. (a) How to check the overflow condition(s). (b) How to check the underflow condition(s). (c) What action is taken for insertion, if the rear has reached the last index and front is somewhere in the middle of the array? (d) What action is taken for deletion, if the front has reached the last index and rear is somewhere in the middle of the array? (e) What action is taken for insertion if the queue is initially empty