full stack – McqOptions

MCQOPTIONS

1.	full stack
A.	invalid index
B.	empty stack
C.	infinite stack
Answer» D.

Discussion

No Comment Found

Related MCQs

Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N)?
Array implementation of Stack is not dynamic, which of the following statements supports this argument?
What is the functionality of the following piece of Java code?Assume: ‘a’ is a non empty array of integers, the Stack class creates an array of specified size and provides a top pointer indicating TOS(top of stack), push and pop have normal meaning.
What happens when you pop from an empty stack while implementing using the Stack ADT in Java?
What does ‘stack underflow’ refer to?
What does the following function check for? (all necessary headers to be included and function is called from main)
WHAT_HAPPENS_WHEN_YOU_POP_FROM_AN_EMPTY_STACK_WHILE_IMPLEMENTING_USING_THE_STACK_ADT_IN_JAVA??$
Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N)?
What is the time complexity of pop() operation when the stack is implemented using an array?
stack is full