What operation does the following diagram depict?

Related MCQs

• Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
• Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
• Which of the following is not the possible operation on stack?
• Which of the following is a possible operation on queue?
• What is the result of the following operation? Top (Push (S, X))
• ………… is not the operation that can be performed on queue.
• The operation of processing each element in the list is known as
• ………… is not the operation that can be performed on queue.
• 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
• When the push operation is performed on stack the value of TOS will be ______