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.

What are three advantages of using functions?

993

---

How does sublist works in java?

947

---

What happens if we don’t define serial version uid?

1015

---

Can memory leak happen java?

988

---

What is the static method?

1056

---

Explain about strings in java?

1053

---

What is a function in programming?

1024

---

What is the use of arraylist class in java?

1056

---

What is meant by the value of a variable?

904

---

what is the volatile modifier for? : Java thread

980

---

What is immutable in java?

1047

---

Is it possible to write a regular expression to check if string is a number?

1009

---

What is nested loop? What is dangling else condition in it?

1057

---

Which programming language is most secure?

972

---

What is externalizable interface?

1087

---