Discussion
What will be the output of the program?
import java.util.*;
public class Fragment98
{
public static void main(String[] args)
{
Map<String, String> m = new LinkedHashMap<String, String>();
m.put("a", "1");
m.put("b", "2");
Iterator<String> it = m.keySet().iterator();
it.next();
it.remove();
System.out.println(m);
}
}
Answer: B
Removing through the key-set iterator is the supported way to delete during iteration, and because the set is a view the whole entry goes from the map. Insertion order leaves a first, so a is the one removed and {b=2} remains.
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