Pushing an element into stack already having five elements and stack size of 5, then stack becomes

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.
• 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.
• Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
• In a stack, if a user tries to remove an element from empty stack it is called
• What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
• 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?
• If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
• Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
• 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
• In stack, to display the lastly inserted element without removing it, which function is used?