Home › Subjects › Java Programming › Collections Framework

Java Programming
Collections Framework

Java OOP, collections, multithreading

100 Q 10 Topics Take Test

Difficulty: All Easy Medium Hard 61–70 of 100

Topics in Java Programming

All Basics & Syntax 100 OOP in Java 100 Collections Framework 100 Multithreading 100 Exception Handling 100 I/O Streams 100 JDBC 100 Generics 100 Lambda Expressions 100 Spring Framework Basics 58

Q.61 Medium Collections Framework

What is the time complexity of add() operation in ArrayList?

A O(1) amortized

B O(n)

C O(log n)

D O(n log n)

Correct Answer: A. O(1) amortized

EXPLANATION

ArrayList.add() has O(1) amortized time complexity. When capacity is exceeded, resizing takes O(n).

Take Test

Q.62 Easy Collections Framework

Which of the following correctly represents the hierarchy of Collection framework?

A Collection -> List -> Map -> Set

B Iterable -> Collection -> List/Set/Queue

C Object -> Iterable -> List -> Collection

D Map -> Collection -> List -> Set

Correct Answer: B. Iterable -> Collection -> List/Set/Queue

EXPLANATION

The correct hierarchy is Iterable (interface) -> Collection -> List/Set/Queue/Deque interfaces.

Take Test

Q.63 Easy Collections Framework

What does the poll() method return when called on an empty Queue?

A throws NoSuchElementException

B returns null

C returns empty object

D blocks indefinitely

Correct Answer: B. returns null

EXPLANATION

poll() returns null if the queue is empty, while remove() throws NoSuchElementException.

Take Test

Q.64 Easy Collections Framework

Which collection class is synchronized by default?

A HashMap

B ArrayList

C Hashtable

D TreeSet

Correct Answer: C. Hashtable

EXPLANATION

Hashtable is a legacy synchronized collection class. HashMap, ArrayList, and TreeSet are not synchronized by default.

Take Test

Q.65 Easy Collections Framework

What is the default initial capacity of a HashMap in Java?

A 8

B 16

C 32

D 64

Correct Answer: B. 16

EXPLANATION

HashMap has a default initial capacity of 16 and a load factor of 0.75.

Take Test

Q.66 Easy Collections Framework

Which of the following Collection interfaces does NOT support duplicate elements?

A Set

B List

C Queue

D Collection

Correct Answer: A. Set

EXPLANATION

Set interface does not allow duplicate elements, while List, Queue, and Collection support duplicates.

Take Test

Q.67 Hard Collections Framework

In a multi-threaded environment, if you need a thread-safe list that allows concurrent reads, which is optimal?

A Collections.synchronizedList(new ArrayList())

B new CopyOnWriteArrayList()

C new Vector()

D new LinkedList()

Correct Answer: B. new CopyOnWriteArrayList()

EXPLANATION

CopyOnWriteArrayList is optimal for read-heavy concurrent operations. It creates copy on write, allowing safe concurrent reads.

Take Test

Q.68 Easy Collections Framework

Which Collection method was introduced in Java 9 to create immutable collections?

A Collections.unmodifiableList()

B List.of()

C List.copyOf()

D Stream.collect()

Correct Answer: B. List.of()

EXPLANATION

Java 9 introduced factory methods like List.of(), Set.of(), Map.of() for creating immutable collections.

Take Test

Q.69 Hard Collections Framework

Consider implementing a Comparator for custom sorting in reverse order. Which approach is correct?
List list = Arrays.asList(5, 2, 8, 1);

A Collections.sort(list, Collections.reverseOrder());

B Collections.sort(list, (a,b) -> b.compareTo(a));

C Collections.sort(list, (a,b) -> a.compareTo(b) * -1);

D All of above

Correct Answer: D. All of above

EXPLANATION

All three approaches work correctly for reverse sorting. Options A, B, and C are all valid Java code.

Take Test

Q.70 Hard Collections Framework

What is the behavior of get() method in LinkedHashMap with accessOrder=true?

A Returns element without affecting order

B Moves accessed element to end (updates access order)

C Throws exception

D Returns null for accessed elements

Correct Answer: B. Moves accessed element to end (updates access order)

EXPLANATION

LinkedHashMap with accessOrder=true maintains access-order. get() moves the element to the end (LRU cache behavior).

Take Test

1…5 6 7 8 9 10

All Subjects & Topics

Medical & Engg

Govt Exams

Teacher Exams

Subjects

Quick Links

Java Programming
Collections Framework

All Subjects & Topics

Medical & Engg

Govt Exams

Teacher Exams

Subjects

Quick Links

Java Programming Collections Framework

Java Programming
Collections Framework