Java Collections Framework Quiz

<p><code>clear()</code> (A)</p> Signup and view all the answers

<p>It represents a key-value pair in a map (B)</p> Signup and view all the answers

<p><code>Collections.synchronizedCollection()</code> (D)</p> Signup and view all the answers

<p>A <code>LinkedHashSet</code> maintains the insertion order of elements, while a <code>HashSet</code> does not (D)</p> Signup and view all the answers

<p>It reverses the order of elements in a list (B)</p> Signup and view all the answers

<p>Test - 10 Test - 10 (D)</p> Signup and view all the answers

<p>ConcurrentModificationException is thrown (B)</p> Signup and view all the answers

<p>12345 (A)</p> Signup and view all the answers

<p>SessionList (C)</p> Signup and view all the answers

<p>It maintains the insertion order and guarantees uniqueness (B)</p> Signup and view all the answers

<p>enqueue and dequeue (D)</p> Signup and view all the answers

<p>true (A)</p> Signup and view all the answers

<p>O(1) (B)</p> Signup and view all the answers

<p>{A=1, B=2, C=3} (A)</p> Signup and view all the answers

<p>false (C)</p> Signup and view all the answers

<p>ArrayList (C)</p> Signup and view all the answers

<p>All of the mentioned (B)</p> Signup and view all the answers

<p>Prints Present Time &amp; Date (B)</p> Signup and view all the answers

<p>ArrayList &amp; Vector (A)</p> Signup and view all the answers

<p>Array not initialized with a size (C)</p> Signup and view all the answers

<p>The structure of 'obj2' will differ leading to inequality (B)</p> Signup and view all the answers

<p>[1, 3, 4, 8, 9] (D)</p> Signup and view all the answers

<p>58881 (D)</p> Signup and view all the answers

<p>0 (C)</p> Signup and view all the answers

<p>getProperty() (B)</p> Signup and view all the answers

<p>put() (C)</p> Signup and view all the answers

<p>HashSet listToSet = new HashSet(duplicateList); (C)</p> Signup and view all the answers

<p>12345 (B)</p> Signup and view all the answers

<p>ListIterator (C)</p> Signup and view all the answers

<p>next() (C)</p> Signup and view all the answers

<p>False (B)</p> Signup and view all the answers

<p>[B, C] (A)</p> Signup and view all the answers

<p>true (C)</p> Signup and view all the answers

<p>{C=8, B=2} (B)</p> Signup and view all the answers

<p>HashSet (C)</p> Signup and view all the answers

<p>SortedList (C)</p> Signup and view all the answers

<p>fill() (B)</p> Signup and view all the answers

<p>[AB, BC, CD] (D)</p> Signup and view all the answers

<p>Vector (D)</p> Signup and view all the answers

<p>get() (D)</p> Signup and view all the answers

<p>IllegalStateException (A)</p> Signup and view all the answers

<p>add() (A)</p> Signup and view all the answers

<p>3 (D)</p> Signup and view all the answers

<p>2 (B)</p> Signup and view all the answers

<p>Set (C)</p> Signup and view all the answers

Converts a collection to an array.

Methods in Java to change list size and elements.

Provides tools to cycle through collection elements.

Removes all elements from a collection.

Represents key-value pairs in a map.

Creates synchronized (thread-safe) collections.

LinkedHashSet remembers insertion order; HashSet does not.

Creates a thread-safe version of a map.

Prints the current time and date using the Date class in Java.

Accessing an element in an ArrayList has a time complexity of O(1).

ArrayList is a standard Java collection class that implements dynamic arrays.

Enqueue and dequeue are used to insert and delete items from a queue, respectively.

Array, in most implementations, is a standard collection class that implements functions of a list data structure.

Modifying a TreeSet by multiple threads simultaneously can cause a ConcurrentModificationException.

A HashSet in Java can store objects of different types (e.g., Long and Integer), but they will be treated as distinct elements.

Enumeration is a legacy interface used for traversing collections.

Maintains insertion order and guarantees uniqueness of elements.

Both ArrayList and Vector are dynamic arrays, but ArrayList is preferred for its efficiency.

HashMap outputs key-value pairs as "key=value"

A class that stores data in key-value pairs, using the key to access values.

A data structure that stores values, offering quick access based on a unique key.

ArrayList objects are compared for equality based on content, not object references directly.

The Java program sorts an array and prints its sorted values.

In Java, a Map class object stores data in key-value pairs, and you access data using the key.

The next() method moves to the next element in a collection, returning the current element.

The set() method replaces an existing element at a specific index in a LinkedList.

The removeFirst() method removes and returns the first element from the LinkedList.

The removeAll(obj) method removes all elements present in the specified collection (obj) from the current collection.

The remove(key) method removes the key-value pair associated with the specified key from the Hashtable.

The HashSet class implements the Set interface, which guarantees unique elements.

The SortedList interface is not part of the Java collection framework.

The fill() method changes all elements of a collection to a specified value.

TreeSet automatically sorts elements in ascending order based on their natural ordering (e.g., alphabetically for strings, numerically for integers).

The Arrays.fill() method replaces a range of elements in an array with a specified value.

The clear() method removes all key-value pairs from a Hashtable object, making it empty.

The getProperty() method retrieves the value associated with a specific key in a Properties object.

The put() method adds a new key-value pair to a Map object, or updates an existing key's value if it already exists.

To remove duplicates from a List, convert it to a HashSet, which automatically eliminates duplicates.

The ListIterator interface provides methods specifically for traversing and modifying elements in a List in both forward and backward directions.

A HashMap is an unordered collection, meaning elements are not stored in a specific order.

A HashMap in Java is a data structure that implements the Map interface using a hash table for efficient key-value storage.

The Map interface in Java defines methods for storing and retrieving key-value pairs. It doesn't specify the underlying implementation, allowing different data structures like HashMap or TreeMap.

The get() method of a BitSet object in Java allows you to check if a bit at a specific index is set (1) or not (0).

The remover() method in Java can throw an IllegalStateException if a collection is modified outside of its iterator's scope while iterating.

The add() method in a HashSet object adds a new element to the set. It doesn't allow duplicates and maintains the set's uniqueness.

In ArrayList, size() returns the actual number of elements in the list, while length() refers to the allocated capacity of the underlying array.

The Set interface in Java guarantees that it holds only unique elements. Duplicates are automatically ignored when added to the set.

In a circular queue, MAX_SIZE represents the fixed size of the underlying array used to store elements. Once the queue is full, it will wrap around to the beginning of the array.