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.

Related MCQs

• 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 a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
• In stack deletion operation is referred as _____
• In a stack, if a user tries to remove an element from empty stack it is called
• Pushing an element into stack already having five elements and stack size of 5, then stack becomes
• What is the term for inserting into a full queue known as?
• Process of inserting an element in stack is called
• Process of inserting an element in stack is called ____________.
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• In a priority queue, insertion and deletion takes place at ………………