eries of operations: add(‘k’), add(‘m’), add(‘n’), remove(), add(‘s’) and remove() are performed on an empty queue of size 4. Which of the following is FALSE?AThe next add operation will set tail to 0BThe next two calls to add(item) will make the queue fullCThe value of front is 2 and and the value of tail is 3DThe next delete operation will set front to 0

Remove operation on a queue CANNOT be performed if ...Athe queue is fullBthe queue is not fullCthe queue is emptyDthe queue is not empty

Observe the following code:1: temp = queue[front];2: if (front== size-1)3: front = 0;4: else5: front++;6: counter --;Which of the following is FALSE?AThis is the algorithm to remove data from the queueBIn line 2-3, front is set to 0 only if front has reached the maximum indexCIn Line 1, the front data is copied into the temporary storage first before it is removed from the queue.DIn line 5, the statement should be corrected so that it is written front-- to represent the removal of a data from the queue.

In an ideal implementations of a queue, all operations are ______________________ . A. O(1) B. O(n) C. O(n2) D. it depends on the operation E. O(n log n)

A double-ended queue allows A. adding elements at one end and removing them from both ends B. adding elements at one end, removing them from the other end, and viewing (first) elements at either end. C. adding, removing, and viewing elements at either end. D. adding elements at both ends and removing them from one end E. none of the above

A Circular queue of capacity 'n – 1' elements is implemented with an array of 'n' elements. Assume that the insertion and deletion operations 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?