Discussion
What will be the output of the program?
import java.util.*;
public class Demo15
{
public static void main(String[] args)
{
LinkedList<String> queue = new LinkedList<String>();
queue.addFirst("b");
queue.addLast("c");
queue.addFirst("a");
System.out.println(queue + " " + queue.peekLast());
}
}
Answer: C
addFirst pushes onto the head and addLast onto the tail, so b then c gives [b, c], and adding a at the head gives [a, b, c]. peekLast reports the tail without removing it, which is c. LinkedList implements Deque, which is where these methods come from.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development