<h3>What is the Collection framework in Java?&nbsp;</h3>
<p dir="ltr">Collection&nbsp; of the objects is nothing but the Group of any individual objects which are represented as a single unit is collection.In java, collection represents a group of objects as a single unit.</p>
<h3>Explain the hierarchy of the Collection framework in Java.</h3>
<p><img style="display: block; margin-left: auto; margin-right: auto;" src="media/blogs/Collection%20Hirearchy.png" alt="Collection_framework_hirearchy" width="848" height="477"></p>
<h3 dir="ltr">What are the advantages of the Collection framework?</h3>
<ul>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Reduces programming effort</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Increases program speed and quality</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Allows interoperability among unrelated APIs</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Reduces effort to learn and to use new APIs</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Reduces effort to design new APIs</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Fosters software reuse</p>
</li>
</ul>
<h3 dir="ltr">Explain the various interfaces used in the Collection framework.</h3>
<ul>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Collection&nbsp;</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Set&nbsp;</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">List</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Queue</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Deque</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">Map</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">SortedSet&nbsp;</p>
</li>
<li dir="ltr" aria-level="1">
<p dir="ltr" role="presentation">SortedMap</p>
</li>
</ul>
<p><strong>&nbsp;</strong></p>
<h3 dir="ltr">What are the main differences between array and collection?</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">Array</h3>
</td>
<td>
<h3 dir="ltr">Collection</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Array can only store same type of objects(i.e. Homogeneous objects)</p>
</td>
<td>
<p dir="ltr">Collection can store different types of objects</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Arrays don&rsquo;t have any inbuilt methods to be used for different operations like searching, sorting etc</p>
</td>
<td>
<p dir="ltr">Collection framework has different inbuilt methods which can be used for several operations.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Array is static</p>
</td>
<td>
<p dir="ltr">Collection is dynamic</p>
</td>
</tr>
</tbody>
</table>
<h3>ArrayList vs LinkedList&nbsp; vs Vector</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">Array List</h3>
</td>
<td>
<h3 dir="ltr">LinkedList</h3>
</td>
<td>
<h3 dir="ltr">Vector</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">The ArrayList class is a resizable array</p>
</td>
<td>
<p dir="ltr">The LinkedList class is a collection which can contain many objects of the same type</p>
</td>
<td>
<p dir="ltr">The Vector class implements a growable array of objects. Like an array, it contains components that can be accessed using an integer index.&nbsp;</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">ArrayList is not synchronized.</p>
</td>
<td>
<p dir="ltr">LinkedList is not synchronized.</p>
</td>
<td>
<p dir="ltr">Vector is synchronized.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Arraylist is not thread-safe</p>
</td>
<td>
<p dir="ltr">Linkedlist is not thread-safe</p>
</td>
<td>
<p dir="ltr">Vector list is thread-safe</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">ArrayList is not a legacy class.&nbsp;</p>
</td>
<td>
<p dir="ltr">LinkedList is not a legacy class.</p>
</td>
<td>
<p dir="ltr">Vector is a legacy class.</p>
</td>
</tr>
</tbody>
</table>
<h3>What is the difference between List and Set?</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">List</h3>
</td>
<td>
<h3 dir="ltr">Set</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">The List interface in Java provides a way to store the ordered collection which maintains the insertion order. It is a child interface of Collection.</p>
</td>
<td>
<p dir="ltr">Set is an unordered collection which does not preserve the insertion order.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">The List can contain duplicate elements</p>
</td>
<td>
<p dir="ltr">Set includes unique items.</p>
</td>
</tr>
</tbody>
</table>
<h3>What is the difference between HashSet and TreeSet?</h3>
</div>
</div>
<h3>&nbsp;</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">HashSet</h3>
</td>
<td>
<h3 dir="ltr">TreeSet</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashSet is backed by HashMap</p>
</td>
<td>
<p dir="ltr">TreeSet is backed by TreeMap</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashSet performs faster than TreeSet.</p>
</td>
<td>
<p dir="ltr">TreeSet performs slower than HashSet.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashSet maintains no order</p>
</td>
<td>
<p dir="ltr">TreeSet maintains ascending order.</p>
</td>
</tr>
</tbody>
</table>
<h3>What is the difference between Set and Map?</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">Set</h3>
</td>
<td>
<h3 dir="ltr">Map</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Set contains only values</p>
</td>
<td>
<p dir="ltr">Map contains key and values both.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Set contains only unique values&nbsp;</p>
</td>
<td>
<p dir="ltr">Maps can contain unique Keys with duplicate values.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">Set holds a single number of null value</p>
</td>
<td>
<p dir="ltr">Map can include a single null key with n number of null values</p>
</td>
</tr>
</tbody>
</table>
<h3>What is the difference between HashSet and HashMap?</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">HashSet</h3>
</td>
<td>
<h3 dir="ltr">HashMap</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashSet cannot have any duplicate value</p>
</td>
<td>
<p dir="ltr">HashMap can contain duplicate values with unique keys.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashSet contains the only single number of null value</p>
</td>
<td>
<p dir="ltr">HashMap can hold a single null key with n number of null values.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashSet implements Set interface</p>
</td>
<td>
<p dir="ltr">HashMap implements the Map interface</p>
</td>
</tr>
</tbody>
</table>
<h3>&nbsp;What is the difference between HashMap and TreeMap?</h3>
</div>
</div>
</div>
<h3>&nbsp;</h3>
<div dir="ltr" align="left">
<table><colgroup><col><col></colgroup>
<tbody>
<tr>
<td>
<h3 dir="ltr">HashMap</h3>
</td>
<td>
<h3 dir="ltr">TreeMap</h3>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashMap maintains no order</p>
</td>
<td>
<p dir="ltr">TreeMap maintains ascending order.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashMap can be sorted by Key or value</p>
</td>
<td>
<p dir="ltr">TreeMap can be sorted by Key.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashMap is implemented by hash table</p>
</td>
<td>
<p dir="ltr">TreeMap is implemented by a Tree structure.</p>
</td>
</tr>
<tr>
<td>
<p dir="ltr">HashMap may contain a null key with multiple null values</p>
</td>
<td>
<p dir="ltr">TreeMap cannot hold a null key but can have multiple null values.</p>
</td>
</tr>
</tbody>
</table>
</div>
<h3 dir="ltr">What is BlockingQueue?</h3>
<p dir="ltr">java.util.concurrent.BlockingQueue is a java Queue. It provides concurrency in the operations like retrieval, insertion, deletion. It supports operations that wait for the queue to become non-empty when retrieving and removing an element, and wait for space to become available in the queue when adding an element.</p>
<h3 dir="ltr">What is the advantage of the Properties file?</h3>
<p dir="ltr">Java Properties files are useful resources to add information in Java. If any information is changed from the properties file, you don't need to recompile the java class. It is used to store information which is to be changed frequently.</p>
<h3 dir="ltr">What is the hashCode() method?</h3>
<p dir="ltr">The hashCode() method is used to generate the hash values of objects.Using these hash values, these objects are stored in Java collections such as HashMap, HashSet and HashTable.</p>
<h3 dir="ltr">What is the Dictionary class?</h3>
<p dir="ltr">The Dictionary class is the abstract parent of any class, such as Hashtable, which maps keys to values. Every key and every value is an object. In any one Dictionary object, every key is associated with at most one value. Given a Dictionary and a key, the associated element can be looked up. Any non-null object can be used as a key and as a value.</p>
<p dir="ltr">These are some most important questions asked from the topic collection framework in java. These will give you a short revision of collection framework.</p>
<h3><strong>&nbsp;</strong></h3>
<h3 dir="ltr">&nbsp;</h3>
<h3>&nbsp;</h3>
</div>
<p><strong id="docs-internal-guid-573fbc54-7fff-e89d-40d4-20fe54b56f7e"></strong></p>

Collection  of the objects is nothing but the Group of any individual objects which are represented as a single unit is collection.In java, collection represents a group of objects as a single unit.

Most asked Collection framework Interview questions

Help Others, Please Share