adplus-dvertising
frame-decoration

Question

What does ‘stack underflow’ refer to?

a.

accessing item from an undefined stack

b.

adding items to a full stack

c.

removing items from an empty stack

d.

index out of bounds exception

Answer: (c).removing items from an empty stack

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What does ‘stack underflow’ refer to?

Similar Questions

Discover Related MCQs

Q. What is the time complexity of pop() operation when the stack is implemented using an array?

Q. 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).

Q. What happens when you pop from an empty stack while implementing using the Stack ADT in Java?

Q. ‘Array implementation of Stack is not dynamic’, which of the following statements supports this argument?

Q. 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).

Q. What is the complexity of searching for a particular element in a Singly Linked List?

Q. Which of the following statements are correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?

Q. What does ‘stack overflow’ refer to?

Q. Consider these functions:
push() : push an element into the stack

pop() : pop the top-of-the-stack element

top() : returns the item stored in top-of-the-stack-node

What will be the output after performing these sequence of operations

push(20);

push(4);

top();

pop();

pop();

pop();

push(5);

top();

Q. Which of the following data structures can be used for parentheses matching?

Q. Minimum number of queues to implement stack is ___________

Q. Which of the following properties is associated with a queue?

Q. In a circular queue, how do you increment the rear end of the queue?

Q. What is the term for inserting into a full queue known as?

Q. What is the time complexity of enqueue operation?

Q. What is the need for a circular queue?

Q. What is the space complexity of a linear queue having n elements?

Q. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

Q. In linked list implementation of a queue, where does a new element be inserted?

Q. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?