Answer Posted / sumit

set-->
when uniqueness is required you need to implement set.
e.g.
HashSet(unOrd,unSort) Fast access, assures no duplicates,
provides no ordering.
LinkedHashSet(Ord,unSort)No duplicates; iterates by
insertion order.
TreeSet(ascending,naturalord)No duplicates ; iterates in
sorted order.

list-->
when ordered list is required you need to implement list.
e.g.
ArrayList(Ord,unSort)Fast iteration and fast random access.
Vector(syncronized)
LinkedList()Good for adding elements to the ends, i.e.,
stacks and queues.

Explain about fail safe iterators in java?

964

---

Does java set allow duplicates?

1028

---

Explain about anonymous inner classes in java?

1002

---

What is the base class for error and exception?

950

---

Why do we need singleton?

929

---

Can a class have 2 constructors?

851

---

What is the difference between static class and normal class?

981

---

Is java an open source?

930

---

How do you square a number?

1170

---

What is externalizable?

1014

---

When should I use stringbuffer?

960

---

what do you understand by synchronization? : Java thread

943

---

What best practices should you follow while writing multithreaded code in java?

999

---

What are different types of multitasking?

908

---

Can you run java program without main method?

1019

---