Question
public void function(Object item)
{
Node temp=new Node(item,trail);
if(isEmpty())
{
head.setNext(temp);
temp.setNext(trail);
}
else
{
Node cur=head.getNext();
while(cur.getNext()!=trail)
{
cur=cur.getNext();
}
cur.setNext(temp);
}
size++;
}
a.
Insert at the front end of the dequeue
b.
Insert at the rear end of the dequeue
c.
Fetch the element at the rear end of the dequeue
d.
Fetch the element at the front end of the dequeue
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. What is the functionality of the following piece of code?
Similar Questions
Discover Related MCQs
Q. What are the applications of dequeue?
View solution
Q. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
View solution
Q. After performing these set of operations, what does the final list look contain?
InsertFront(10);
InsertFront(20);
InsertRear(30);
DeleteFront();
InsertRear(40);
InsertRear(10);
DeleteRear();
InsertRear(15);
display();
View solution
Q. To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?
View solution
Q. Express -15 as a 6-bit signed binary number.
View solution
Q. What is the time complexity for converting decimal to binary numbers?
View solution
Q. Which data structure can be used suitably to solve the Tower of Hanoi problem?
View solution
Q. Which among the following is not a palindrome?
View solution
Q. Which data structure can be used to test a palindrome?
View solution
Q. What is the number of moves required in the Tower of Hanoi problem for k disks?
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!
