Question

which operation is not possible in queue​

Answer 1

Explanation:

The queue has 3 operations:

Initialize the data structure, indices, pointers etc.

Insert an item into the queue. The insertion is made at the tail of the queue.

Get/remove an item from the queue. This operation is made at the head of the queue.

Answer 2

The operation which is not possible in the queue is as follows:

• Unlike the arrays, linked lists, elements in the queue, etc., cannot be operated from their respective locations.
• The basic queue operations are defined as the insertion and deletion. However, the enqueue process is at the front of the queue and the dequeue is done at the end of the queue.
• The elements in a queue are arranged sequentially for the process to complete.
• Moreover, it can only be operated in the queue at two data pointers, front and rear.
• Also, the basic operations of a queue are possible in the queue.
• Thus, add an element to the end of the queue and remove an element from the front of the queue.
• When the is empty, the first step is to check if the queue is empty and when the queue is full, it is necessary to check if the queue is full and ready for the next process in the queue.

#SPJ6