adplus-dvertising
frame-decoration

Question

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();

a.

20

b.

4

c.

stack underflow

d.

5

Answer: (d).5

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

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

Q. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

Q. In linked list implementation of a queue, from where is the item deleted?

Q. In linked list implementation of a queue, the important condition for a queue to be empty is?

Q. The essential condition which is checked before insertion in a linked queue is?

Q. The essential condition which is checked before deletion in a linked queue is?

Q. With what data structure can a priority queue be implemented?

Q. Which of the following is not an application of priority queue?

Q. What is the time complexity to insert a node based on key in a priority queue?