0% found this document useful (0 votes)
101 views34 Java Collections Interview Questions
Uploaded by
Ayalkibet AbrihamCopyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
101 views34 Java Collections Interview Questions
Uploaded by
Ayalkibet AbrihamCopyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
/ 21
‘2122, 1:58 PM Java Collections Interview Questions (2023) javatpoint
Home Interview Questions ava sau Pythor JavaSerip Angula
JaveW7 root
rrr)
eee ie
SCROLL TO TOP Bites
|nps:iiwwjavalpoin comijava-colectonsnteriew-questions at ‘2122, 1:58 PM Java Collections Interview Questions (2023) javatpoint
34 Java Collections Interview Questions
In Java, collection interview questions are most asked by the interviewers, Here is the list of the most
asked collections interview questions with answers.
1) What is the 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.
2) 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, ie., 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.
3) Explain various interfaces used in Collection framework?
Collection framework implements various interfaces, Collection interface and Map interface
(ava.utilMap) are the mainly used interfaces of Java Collection Framework. List of interfaces of
Collection Framework is given belo
|nps:iiwwjavalpoin comijava-cotectonsnteriew-questions ‘2122, 1:58 PM Java Collections Interview Questions (2023) javatpoint
1. Collection interface: Collection (java.util.Collection) is the primary interface, and every collection
must implement this interface.
Syntax:
public interface Collection extends Iterable
Where 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:
| public interface List extends Collection
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:
interface Set extends Collection
[=
Queue interface: Queue (java.util. Queue) interface defines queue data structure, which stores the
elements in the form FIFO (first in first out)
-nps:ihwwjavalpoin comijava-colectonsnterview-questions a1 ‘2122, 1:58 PM Java Collections Interview Questions (2023) javatpoint
Syntax:
public interface Queue extends Collection<€>
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:
public interface Dequeue extends Queue
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.
4) 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.
3) ArrayList increases its size by 50% of the Vector increases its size by doubling the array
array size. size.
4) ArrayList is not ?thread-safe? as it is not Vector list ic ?thread-cafe? ac it?< every methad
synchronized. is sync
5) What is the difference between ArrayList :
No. ArrayList LinkedL.
|nps:ihwwjavalpoin comijava-colectons-nterview-questions aan s21raina, 11:58 PM
1) ArrayList uses a dynamic array.
2) Arraylist' is not efficient for
manipulation because too much is
required.
3) ArrayList is better to store and fetch
data.
4) ArrayList provides random access.
5) ArrayList takes less memory overhead
as it stores only object
6) What is the difference between Ite!
Iterator traverses the elements in the forward
elements into forward and backward direction.
No. Iterator
1) The Iterator traverses the elements in
the forward direction only.
2) The Iterator can be used in List, Set, and
Queue,
3) The Iterator can only perform remove
operation while traversing the
collection
|nps:iiwwjavalpoin comijava-colectonsnterview-questions
Java Collections Interview Questions (2023) javatpoint
LinkedList uses a doubly linked list.
LinkedList is efficient for manipulation.
LinkedList is better to manipulate data,
LinkedList does not provide random access.
LinkedList takes more memory overhead, as it
stores the object as well as the address of that
object
rator and Listlterator?
direction only whereas Listiterator traverses the
Listlterator
Listiterator traverses the elements in backward
and forward directions both.
Listiterator can be used in List only.
Listlter,
set? op ‘2am, 154M Java Colectons Interview Questions (2023) javatpoint
7) What is the difference between Iterator and Enumeration?
No. Iterator Enumeration
1) The Iterator can traverse legacy and non- Enumeration can traverse only legacy
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.
4) The Iterator can perform remove operation |The Enumeration can perform only traverse
while traversing the collection operation on the collection.
8) 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.
|nps:iiwwjavalpoin comijava-cotectonsnteriew-questions 621 s21ramna, 1:58 PM Java Collections Interview Questions (2023) javatpoint
9) 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.
10) 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 contait
© Set holds a single number of null value whereas
number of null values.
|nps:iiwwjavalpoin comijava-colectonsnteriew-questions ma s21eare2, 1:58 PM Java Collections Interview Questions (2023) javatpoint
11) 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.
12) 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
13) What is the difference between HashMap and Hashtable?
No.
1)
3)
HashMap Hashtable
HashMap is not synchronized. Hashtable is synchronized.
HashMap can contain one null key and Hashtable cannot contain any null key or
multiple null values. ne
HashMap is not ?thread-safe,? so it is useful Hi
for non-threaded applications. sh
4) HashMap inherits the AbstractMap class H:
hitps:ww javatpoint comjava-colections-intrviow-questions a1 ‘2am, 154M Java Collections Itervew Questions (2023)-javatpoin
14) 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.
15) What is the difference between Comparable and Comparator?
No. Comparable Comparator
1) Comparable provides only one sort of sequence. The Comparator provides multiple
sorts of sequences.
2) It provides one method named compareTo0. It provides one method named
compare()
3) Itis found in javatang package. Itis located in java.util package
4) If we implement the Comparable interface, The The actual class is not changed
actual class is modified.
16) 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 availahle cnara. RlacbinnMnane cannot
contain null elements, and implementation of BlockingQui
Syntax:
public interface BlockingQueue extends Queue list=new Arraylist();
list.add(‘ankit’);
list.add(“nippun");
System.out.printin(list.size();
28) How to convert ArrayList to Array and Array to ArrayList?
We can convert an Array to ArrayList by using the asList()
the static method of Arrays class and accepts the List obje
Arrays.asList(item)
|nps:iiwwjavalpoin comijava-colectonsnteriew-questions va ‘2am, 154M Java Collections Itervew Questions (2023)-javatpoin
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
List_object:toArray(new String[List_objectsize(])
29) 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.
30) 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
31) 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.terator,
import java.util.List;
|nps:iiwwjavalpoin comijava-colectonsnterview-questions swt ‘arena, 1:58PM Java Colectons Interview Questions (2023) javatpoint
public class ReverseArrayList {
public static void main(String{] args) {
List list = new ArrayList<>0;
listadd(10);
listadd(50);
listadd(30);
Iterator i = listiterator();
System.out printin("printing the list..."
while(,hasNext()
System.out printin(inextQ);
}
Iterator i2 = listiterator();
Collections.reverse(list);
System.out printin("printing list in reverse order.
(i2.hasNextQ)
System.out printin(i2.nextQ);
Output
printing the list
10
printing list in reverse order
50
10
|nps:iiwwjavalpoin comijava-colectonsnteriew-questions ‘2122, 1:58 PM Java Collections Interview Questions (2023) javatpoint
32) 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.|terator;
import java.util.List;
public class ReverseArrayList (
al] args) {
List list = new Arraylist<>0;
list.add(10);
listadd(50);
listadd(30);
listadd(60);
listadd(20);
list.add(90);
public static void main(St
Iterator i = listiteratord;
System.out printin("printing the list...");
while(ihasNext()
{
System.out printin(inextQ);
Comparator cmp = Collections.reverseOrder();
Collections sort(list,cmp);
System.out printin(’printing list in descending order.
Iterator i2 = list.iterator(;
while(i2.hasNext0)
{
|nps:ihwwjavalpoin comijava-cotectons-nteriew-questions ret ‘2122, 1:5 PM Java Collections Interview Questions (2023) javatpoint
System.out printin(i2.next0);
Output
printing the list
10
58
30
60
20
printing 1
90
in descending order.
68
50
30
20
33) How to synchronize ArrayList?
We can synchronize ArrayList in two ways.
© Using Collections synchronizedList) method
© Using CopyOnWriteArrayList
34) When to use ArrayList and LinkedList?
LinkedLists are better to use for the update operations w
search operations.
|nps:iiwwjavalpoin comijava-cotectonsnteriew-questions wet 2122122, 11:54 PM Java Collections Interview Questions (2023) javatpoint
