Answer Posted / debapriya

See HasMap is used when u want to use key value pair
If u r storing Any Objects the better u write ur code for
hascode implementation ,the better the the retrieval process is

Set maintains order,each time u add a object ,it checks
whether it exists or not calling equals which in turn calls
the hashcode method(x.equals(y) means x.hashcode==y.hashcode)

List --->in case if u use Vector or ArrayList since both of
them implenets RandomAccessInterface so retrieval is faster
but addition or deletion is slower

LinkedList --->deletion or insertion is faster but does not
implemet RandomAccess interface

What are peerless components in java programming?

1012

---

What is an anonymous class in java?

1102

---

Why generics are used in java?

1044

---

Is linked list a linear or non-linear data structure?

971

---

Is namespace same as package in java?

984

---

How do you ensure that n threads can access n resources without deadlock?

1309

---

Why do we use string?

1041

---

What are parameters in a method?

1104

---

What is the difference between a constructor and a method?

1249

---

Differentiate between nested and inner class in java.

999

---

What is ascii code?

1265

---

What is sorting in java?

986

---

why not override thread to make a runnable? : Java thread

1002

---

What are the differences between wait() and sleep()?

1016

---

explain multi-threading in java?

1028

---