Concurrent Collections

Question 1

This interface extends the Queue interface. If the queue is empty, it blocks until an element is inserted, and if the queue is full, it blocks until an element is remmoved.

Answer 1

java.util.concurrent.BlockingQueue

Question 2

This class provides a fixed size array based concrete implementation of the BlockingQueue interface.

Answer 2

java.util.concurrent.ArrayBlockingQueue

Question 3

This class provides a linked-list based implementation of the BlockingQueue interface.

Answer 3

java.util.concurrent.LinkedBlockingQueue

Question 4

This class implements BlockingQueue and consists of elements that are of type Delayed. An element can be retrieved from this queue only after its delay period.

Answer 4

java.util.concurrent.DelayQueue

Question 5

Equivalent to java.util.PriorityQueue, but implements the BlockingQueue interface.

Answer 5

java.util.concurrent.PriorityBlockingQueue

Question 6

This class implements BlockingQueue. In this container, each insert() by a thread blocks for a corresponding remove() by another thread and vice versa.

Answer 6

java.util.concurrent.SynchronousQueue

Question 7

Analogous to Hashtable, but with safe concurrent access and updates.

Answer 7

java.util.concurrent.ConcurrentHashMap

Question 8

Analogous to TreeMap, but provides safe concurrent access and updates.

Answer 8

java.util.concurrent.ConcurrentSkipListMap

Question 9

Analogous to TreeSet, but provides safe concurrent access and updates.

Answer 9

java.util.concurrent.ConcurrentSkipListSet

Question 10

Similar to ArrayList, but provides safe concurrent access. When the ArrayList is updated, it creates a fresh copy of the underlying array.

Answer 10

java.util.concurrent.CopyOnWriteArrayList

Question 11

A Set implementation, but provides safe concurrent access and is implemented using CopyOnWriteArrayList. When the container is updated, it creates a fresh copy of the underlying array.

Answer 11

java.util.concurrent.CopyOnWriteArraySet