Search Interview Questions |  More than 3000 questions in repository. There are more than 900 unanswered questions. Click here and help us by providing the answer. Have a video suggestion. Click Correct / Improve and please let us know. |
|
|||
|
| ||||
| Interview Questions and Answers | ||||
| ||||
| Ans. I. If we want a Collection that does not store duplicate values, then we use a Set based collection. II. If we want to frequently access elements operations based on an index value then we use a List based collection. E.g. ArrayList III. If we want to maintain the insertion order of elements in a collection then we use a List based collection. IV. For fast search operation based on a key, value pair, we use a HashMap based collection. V. If we want to maintain the elements in a sorted order, then we use a TreeSet based collection. | ||||
| Help us improve. Please let us know the company, where you were asked this question : | ||||
 Discuss Correct / Improve   Asked in 1 Companies | ||||
 Related Questions | ||||
 What is the difference between ArrayList and LinkedList ? | ||||
| If you are given a choice to use either ArrayList and LinkedList, Which one would you use and Why ? | ||||
| Difference between HashMap and Hashtable? | ||||
| Difference between TreeMap and HashMap ? | ||||
| Can you provide some implementation of a Dictionary having large number of words ? | ||||
| Will this code give error if i try to add two heterogeneous elements in the arraylist. ? and Why ? | ||||
| How is Hashmap internally implemented in Java ? | ||||
| what is fail fast and Fail Safe in collections? | ||||
| What is a ConcurrentHashMap ? | ||||
| Collections.sort can only be performed on .. a. Set b. List c. Map d. Any Collection implementation | ||||
