Collection framework in Java

Collection Framework is a combination of classes and interface, which is used to store and
manipulate the data in the form of objects. It provides various classes such as ArrayList, Vector,
Stack, and HashSet, etc. and interfaces such as List, Queue, Set, etc. for this purpose.

1) What are the main differences between array and collection?

Array and Collection are somewhat similar regarding storing the references of objects and
manipulating the data, but they differ in many ways. The main differences between the array and
Collection are defined below:

• Arrays are always of fixed size, i.e., a user can not increase or decrease the length of the
array according to their requirement or at runtime, but In Collection, size can be changed
dynamically as per need.

• Arrays can only store homogeneous or similar type objects, but in Collection,
heterogeneous objects can be stored.

• Arrays cannot provide the ready-made methods for user requirements as sorting,
searching, etc. but Collection includes readymade methods to use.

2) Explain various interfaces used in Collection framework?

Collection framework implements various interfaces, Collection interface and Map interface
(java.util.Map) are the mainly used interfaces of Java Collection Framework. List of interfaces of
Collection Framework is given below:

1. Collection interface: Collection (java.util.Collection) is the primary interface, and every

collection must implement this interface.

Syntax:

1. public interface Collection<E>extends Iterable

Where <E> represents that this interface is of Generic type

2. List interface: List interface extends the Collection interface, and it is an ordered collection of
objects. It contains duplicate elements. It also allows random access of elements.

Syntax:

1. public interface List<E> extends Collection<E>

3. Set interface: Set (java.util.Set) interface is a collection which cannot contain duplicate
elements. It can only include inherited methods of Collection interface
Syntax:

1. public interface Set<E> extends Collection<E>

Queue interface: Queue (java.util.Queue) interface defines queue data structure, which stores
the elements in the form FIFO (first in first out).

Syntax:

1. public interface Queue<E> extends Collection<E>

4. Dequeue interface: it is a double-ended-queue. It allows the insertion and removal of

elements from both ends. It implants the properties of both Stack and queue so it can perform
LIFO (Last in first out) stack and FIFO (first in first out) queue, operations.

Syntax:

1. public interface Dequeue<E> extends Queue<E>

5. Map interface: A Map (java.util.Map) represents a key, value pair storage of elements. Map
interface does not implement the Collection interface. It can only contain a unique key but can
have duplicate elements. There are two interfaces which implement Map in java that are Map
interface and Sorted Map.

3) What is the difference between ArrayList and Vector?

No. ArrayList Vector

1) ArrayList is not synchronized. Vector is synchronized.

2) ArrayList is not a legacy class. Vector is a legacy class.

ArrayList increases its size by 50% of the Vector increases its size by doubling the array
3)
array size. size.

ArrayList is not thread-safe as it is not Vector list is thread-safe as its every method is
4)
synchronized. synchronized.

4) What is the difference between ArrayList and LinkedList?

No. ArrayList LinkedList

1) ArrayList uses a dynamic array. LinkedList uses a doubly linked list.

 ArrayList is not efficient for
2) manipulation because too much is LinkedList is efficient for manipulation.
required.

ArrayList is better to store and fetch

3) LinkedList is better to manipulate data.
data.

4) ArrayList provides random access. LinkedList does not provide random access.

LinkedList takes more memory overhead, as it

ArrayList takes less memory overhead
5) stores the object as well as the address of that
as it stores only object
object.

5) What is the difference between Iterator and ListIterator?

Iterator traverses the elements in the forward direction only whereas ListIterator traverses the
elements into forward and backward direction.

No. Iterator ListIterator

The Iterator traverses the elements in the ListIterator traverses the elements in backward
1)
forward direction only. and forward directions both.

The Iterator can be used in List, Set, and

2) ListIterator can be used in List only.
Queue.

The Iterator can only perform remove ListIterator can perform add, remove, and set
3)
operation while traversing the collection. operation while traversing the collection.

6) What is the difference between Iterator and Enumeration?

No. Iterator Enumeration

The Iterator can traverse legacy and non- Enumeration can traverse only legacy
1)
legacy elements. elements.

2) The Iterator is fail-fast. Enumeration is not fail-fast.

3) The Iterator is slower than Enumeration. Enumeration is faster than Iterator.

 The Iterator can perform remove operation The Enumeration can perform only traverse
4)
while traversing the collection. operation on the collection.

7) What is the difference between List and Set?

The List and Set both extend the collection interface. However, there are some differences
between the both which are listed below.

• The List can contain duplicate elements whereas Set includes unique items.

• The List is an ordered collection which maintains the insertion order whereas Set is an
unordered collection which does not preserve the insertion order.

• The List interface contains a single legacy class which is Vector class whereas Set
interface does not have any legacy class.

• The List interface can allow n number of null values whereas Set interface only allows a
single null value.

8) What is the difference between HashSet and TreeSet?

The HashSet and TreeSet, both classes, implement Set interface. The differences between the
both are listed below.

• HashSet maintains no order whereas TreeSet maintains ascending order.

• HashSet impended by hash table whereas TreeSet implemented by a Tree structure.

• HashSet performs faster than TreeSet.

• HashSet is backed by HashMap whereas TreeSet is backed by TreeMap.

9) What is the difference between Set and Map?

The differences between the Set and Map are given below.

• Set contains values only whereas Map contains key and values both.

• Set contains unique values whereas Map can contain unique Keys with duplicate values.

• Set holds a single number of null value whereas Map can include a single null key with n
number of null values.

10) What is the difference between HashSet and HashMap?

The differences between the HashSet and HashMap are listed below.
 • HashSet contains only values whereas HashMap includes the entry (key, value). HashSet
can be iterated, but HashMap needs to convert into Set to be iterated.

• HashSet implements Set interface whereas HashMap implements the Map interface

• HashSet cannot have any duplicate value whereas HashMap can contain duplicate values
with unique keys.

• HashSet contains the only single number of null value whereas HashMap can hold a
single null key with n number of null values.

11) What is the difference between HashMap and TreeMap?

The differences between the HashMap and TreeMap are given below.

• HashMap maintains no order, but TreeMap maintains ascending order.

• HashMap is implemented by hash table whereas TreeMap is implemented by a Tree

structure.

• HashMap can be sorted by Key or value whereas TreeMap can be sorted by Key.

• HashMap may contain a null key with multiple null values whereas TreeMap cannot hold
a null key but can have multiple null values.

12) What is the difference between HashMap and Hashtable?

No. HashMap Hashtable

1) HashMap is not synchronized. Hashtable is synchronized.

HashMap can contain one null key and Hashtable cannot contain any null key or
2)
multiple null values. null value.

HashMap is not thread-safe, so it is useful for Hashtable is thread-safe, and it can be shared
3)
non-threaded applications. between various threads.

4) HashMap inherits the AbstractMap class Hashtable inherits the Dictionary class.

13) What is the difference between Collection and Collections?

The differences between the Collection and Collections are given below.

• The Collection is an interface whereas Collections is a class.

• The Collection interface provides the standard functionality of data structure to List, Set,
and Queue. However, Collections class is to sort and synchronize the collection elements.
 • The Collection interface provides the methods that can be used for data structure whereas
Collections class provides the static methods which can be used for various operation on
a collection.

14) What is the difference between Comparable and Comparator?

No. Comparable Comparator

The Comparator provides multiple

1) Comparable provides only one sort of sequence.
sorts of sequences.

It provides one method named

2) It provides one method named compareTo().
compare().

3) It is found in java.lang package. It is located in java.util package.

If we implement the Comparable interface, The

4) The actual class is not changed.
actual class is modified.

15) What do you understand by BlockingQueue?

BlockingQueue is an interface which extends the Queue interface. It provides concurrency in the
operations like retrieval, insertion, deletion. While retrieval of any element, it waits for the queue
to be non-empty. While storing the elements, it waits for the available space. BlockingQueue
cannot contain null elements, and implementation of BlockingQueue is thread-safe.

Syntax:

1. public interface BlockingQueue<E> extends Queue <E>

16) What is the advantage of Properties file?

If you change the value in the properties file, you do not need to recompile the java class. So, it
makes the application easy to manage. It is used to store information which is to be changed
frequently. Consider the following example.

import java.util.*;

import java.io.*;

public class Test {

public static void main(String[] args)throws Exception{

FileReader reader=new FileReader("db.properties");

Properties p=new Properties();

 p.load(reader);

System.out.println(p.getProperty("user"));

System.out.println(p.getProperty("password"));

Output

system

oracle

17) What does the hashCode() method?

The hashCode() method returns a hash code value (an integer number).

The hashCode() method returns the same integer number if two keys (by calling equals()
method) are identical.

However, it is possible that two hash code numbers can have different or the same keys.

If two objects do not produce an equal result by using the equals() method, then the hashcode()
method will provide the different integer result for both the objects.

18) Why we override equals() method?

The equals() method is used to check whether two objects are the same or not. It needs to be
overridden if we want to check the objects based on the property.

For example, Employee is a class that has 3 data members: id, name, and salary. However, we
want to check the equality of employee object by the salary. Then, we need to override the
equals() method.

19) How to synchronize List, Set and Map elements?

Yes, Collections class provides methods to make List, Set or Map elements as synchronized:

public static List synchronizedList(List l){}

public static Set synchronizedSet(Set s){}

public static SortedSet synchronizedSortedSet(SortedSet s){}

public static Map synchronizedMap(Map m){}

public static SortedMap synchronizedSortedMap(SortedMap m){}

20) What is the advantage of the generic collection?

There are three main advantages of using the generic collection.

• If we use the generic class, we do not need typecasting.

• It is type-safe and checked at compile time.

• Generic confirms the stability of the code by making it bug detectable at compile time.

21) What is hash-collision in Hashtable and how it is handled in Java?

Two different keys with the same hash value are known as hash-collision. Two separate entries
will be kept in a single hash bucket to avoid the collision. There are two ways to avoid hash-
collision.

• Separate Chaining

• Open Addressing

22) What is the Dictionary class?

The Dictionary class provides the capability to store key-value pairs.

23) What is the default size of load factor in hashing based collection?
The default size of load factor is 0.75. The default capacity is computed as initial capacity * load
factor. For example, 16 * 0.75 = 12. So, 12 is the default capacity of Map.

24) What do you understand by fail-fast?

The Iterator in java which immediately throws ConcurrentmodificationException, if any
structural modification occurs in, is called as a Fail-fast iterator. Fail-fats iterator does not require
any extra space in memory.

25) What is the difference between Array and ArrayList?

The main differences between the Array and ArrayList are given below.

SN Array ArrayList

The Array is of fixed size, means we cannot ArrayList is not of the fixed size we can
1
resize the array as per need. change the size dynamically.
2 Arrays are of the static type. ArrayList is of dynamic size.

Arrays can store primitive data types as ArrayList cannot store the primitive data types
3
well as objects. it can only store the objects.

26) What is the difference between the length of an Array and size of ArrayList?

The length of an array can be obtained using the property of length whereas ArrayList does not
support length property, but we can use size() method to get the number of objects in the list.

Finding the length of the array

1. Int [] array = new int[4];

2. System.out.println("The size of the array is " + array.length);

3.

Finding the size of the ArrayList

1. ArrayList<String> list=new ArrayList<String>();

2. list.add("ankit");

3. list.add("nippun");

4. System.out.println(list.size());

5.

27) How to convert ArrayList to Array and Array to ArrayList?

We can convert an Array to ArrayList by using the asList() method of Arrays class. asList()
method is the static method of Arrays class and accepts the List object. Consider the following
syntax:

1. Arrays.asList(item)

We can convert an ArrayList to Array using toArray() method of the ArrayList class. Consider
the following syntax to convert the ArrayList to the List object.

1. List_object.toArray(new String[List_object.size()])

28) How to make Java ArrayList Read-Only?

We can obtain java ArrayList Read-only by calling the Collections.unmodifiableCollection()
method. When we define an ArrayList as Read-only then we cannot perform any modification in
the collection through add(), remove() or set() method.

29) How to remove duplicates from ArrayList?

There are two ways to remove duplicates from the ArrayList.

• Using HashSet: By using HashSet we can remove the duplicate element from the
ArrayList, but it will not then preserve the insertion order.

• Using LinkedHashSet: We can also maintain the insertion order by using

LinkedHashSet instead of HashSet.

The Process to remove duplicate elements from ArrayList using the LinkedHashSet:

• Copy all the elements of ArrayList to LinkedHashSet.

• Empty the ArrayList using clear() method, which will remove all the elements from the
list.

• Now copy all the elements of LinkedHashset to ArrayList.

30) How to reverse ArrayList?

To reverse an ArrayList, we can use reverse() method of Collections class. Consider the
following example.

import java.util.ArrayList;

import java.util.Collection;

import java.util.Collections;

import java.util.Iterator;

import java.util.List;

public class ReverseArrayList {

public static void main(String[] args) {

List list = new ArrayList<>();

list.add(10);

list.add(50);

list.add(30);
 Iterator i = list.iterator();

System.out.println("printing the list....");

while(i.hasNext())

System.out.println(i.next());

Iterator i2 = list.iterator();

Collections.reverse(list);

System.out.println("printing list in reverse order....");

while(i2.hasNext())

System.out.println(i2.next());

Output

printing the list....

10

50

30

printing list in reverse order....

30

50

10

31) How to sort ArrayList in descending order?

To sort the ArrayList in descending order, we can use the reverseOrder method of Collections
class. Consider the following example.

import java.util.ArrayList;

import java.util.Collection;

import java.util.Collections;

import java.util.Comparator;

import java.util.Iterator;

import java.util.List;

public class ReverseArrayList {

public static void main(String[] args) {

List list = new ArrayList<>();

list.add(10);

list.add(50);

list.add(30);

list.add(60);

list.add(20);

list.add(90);

Iterator i = list.iterator();

System.out.println("printing the list....");

while(i.hasNext())

System.out.println(i.next());

Comparator cmp = Collections.reverseOrder();

Collections.sort(list,cmp);

System.out.println("printing list in descending order....");

 Iterator i2 = list.iterator();

while(i2.hasNext())

System.out.println(i2.next());

Output

printing the list....

10

50

30

60

20

90

printing list in descending order....

90

60

50

30

20

10

32) How to synchronize ArrayList?

We can synchronize ArrayList in two ways.

• Using Collections.synchronizedList() method

• Using CopyOnWriteArrayList<T>
33) When to use ArrayList and LinkedList?
LinkedLists are better to use for the update operations whereas ArrayLists are better to use for
the search operations.