The total number of elements in a stack at a given point of time can be calculated from the value of______.

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.
• Pushing an element into stack already having five elements and stack size of 5, then stack becomes
• 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
• 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?
• Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
• An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
• What will be the value of top, if there is a size of stack STACK_SIZE is 5
• When does top value of the stack changes?