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

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

Match the term with its definition Enqueue Dequeue First Size isEmpty with Check if the queue is empty Check the front element without removing Number of elements in the queue Remove the front element Add an element (back)

The dequeue operation should throw an exception if it removes the last element in the queue. A. True B. False

Write the condition for empty and full circular queue

Select the correct answerif front == -1 && rear == -1In the Array implementation of the queue,the above statement implies that: queue isOptionsfullhaving a single elementnone of theseempty