Question
Select from the options the appropriate pop() operation that can be included in the Stack class. Also ‘first’ is the top-of-the-stack.
class Node
{
protected Node next;
protected Object ele;
Node()
{
this(null,null);
}
Node(Object e,Node n)
{
ele=e;
next=n;
}
public void setNext(Node n)
{
next=n;
}
public void setEle(Object e)
{
ele=e;
}
public Node getNext()
{
return next;
}
public Object getEle()
{
return ele;
}
}
class Stack
{
Node first;
int size=0;
Stack()
{
first=null;
}
}
a)
public Object pop()
{
if(size == 0)
System.out.println("underflow");
else
{
Object o = first.getEle();
first = first.getNext();
size--;
return o;
}
}
b)
public Object pop()
{
if(size == 0)
System.out.println("underflow");
else
{
Object o = first.getEle();
first = first.getNext().getNext();
size--;
return o;
}
}
c)
public Object pop()
{
if(size == 0)
System.out.println("underflow");
else
{
first = first.getNext();
Object o = first.getEle();
size--;
return o;
}
}
d)
public Object pop()
{
if(size == 0)
System.out.println("underflow");
else
{
first = first.getNext().getNext();
Object o = first.getEle();
size--;
return o;
}
}a.
a
b.
b
c.
c
d.
d
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Given below is the Node class to perform basic list operations and a Stack class with a no arg constructor. Select from the options the appropriate pop() operation that can be...
Similar Questions
Discover Related MCQs
Q. What does ‘stack overflow’ refer to?
View solution
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();
View solution
Q. Which of the following data structures can be used for parentheses matching?
View solution
Q. Minimum number of queues to implement stack is ___________
View solution
Q. Which of the following properties is associated with a queue?
View solution
Q. In a circular queue, how do you increment the rear end of the queue?
View solution
Q. What is the term for inserting into a full queue known as?
View solution
Q. What is the time complexity of enqueue operation?
View solution
Q. What is the need for a circular queue?
View solution
Q. What is the space complexity of a linear queue having n elements?
View solution
Q. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
View solution
Q. In linked list implementation of a queue, where does a new element be inserted?
View solution
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?
View solution
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?
View solution
Q. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.
View solution
Q. In linked list implementation of a queue, from where is the item deleted?
View solution
Q. In linked list implementation of a queue, the important condition for a queue to be empty is?
View solution
Q. The essential condition which is checked before insertion in a linked queue is?
View solution
Q. The essential condition which is checked before deletion in a linked queue is?
View solution
Q. With what data structure can a priority queue be implemented?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
