What is CopyOnWriteArrayList? How it is different from ArrayList in

1.	What is CopyOnWriteArrayList? How it is different from ArrayList in Java?
Answer» CopyOnWriteArrayList CREATES a clone of the actual list, for EVERY successive update operation will update internally to the actual list without generating the concurrent modification EXCEPTION, and prevent to throw the concurrent modification exception. HOWEVER, to use this cost more on memory consumption because for every update operation there is one clone copy gets created, we have to use wisely when there is frequent read operation, it is better to use when the same list is shared by a number of thread, whereas ArrayList doesn’t allow any thread safety. However whenever any modification takes place while traversing in the ARRAY lIst its throws the concurrent modification exception.

What is CopyOnWriteArrayList? How it is different from ArrayList in Java?

Answer»

CopyOnWriteArrayList CREATES a clone of the actual list, for EVERY successive update operation will update internally to the actual list without generating the concurrent modification EXCEPTION, and prevent to throw the concurrent modification exception. HOWEVER, to use this cost more on memory consumption because for every update operation there is one clone copy gets created, we have to use wisely when there is frequent read operation, it is better to use when the same list is shared by a number of thread, whereas ArrayList doesn’t allow any thread safety.

However whenever any modification takes place while traversing in the ARRAY lIst its throws the concurrent modification exception.

Discussion

No Comment Found

Related InterviewSolutions

How is WeakHashMap differs from other HashMap?
How the ConcurrentHashMap works, how it provides the thread safety?
What is CopyOnWriteArrayList? How it is different from ArrayList in Java?
When to use the Queue and Stack? What is the possible use case?
When to use the Iterator and Enumeration? What is the possible use case?
How can you use Comparable and Comparator interfaces to sort collections?
What is the situation in which fail-fast and fail-safe iterators works? What are the issues to use the fail-safe along with the example?
What is the purpose of the initial capacity and load factor parameters of a HashMap? What are their default values? How is the threshold plays the role to decide the size?
What is the time complexity of putting and getting an element from such structure? Which Map implementation provide better performance?
What is collision problem? How HashMap performs collision detection and collision prevention when the index position found for the same key, what are the algorithms performed to avoid this situation?