ITSW 3173 D287 Java Frameworks

Correct Answer

C. Storing unique elements

Explanation

The primary function of the HashSet class in Java is to store unique elements. It implements the Set interface, which ensures that no duplicates are stored in the collection. HashSet does not maintain the order of its elements and does not allow duplicate values, which makes it suitable for scenarios where uniqueness is important but order is not.

Why other options are wrong

A. Maintaining the order of elements

This is incorrect because HashSet does not guarantee the order of its elements. If you need to maintain the insertion order, you should use LinkedHashSet instead.

B. Allowing duplicate elements

This is incorrect because HashSet specifically does not allow duplicate elements. If you attempt to add a duplicate element, it will simply not be added to the set.

D. Sorting elements based on a comparator

This is incorrect because HashSet does not sort its elements. If you need a Set implementation that maintains a specific order (like natural order or a custom comparator), TreeSet is the appropriate choice. HashSet does not provide any ordering of its elements.

Correct Answer

A. Sort returns a sorted collection

Explanation

The sort method in the Collections class does not return a sorted collection. Instead, it sorts the collection in place. It modifies the collection passed to it, so the method does not return a new collection. This makes it different from other methods that might return a modified copy of the collection.

Why other options are wrong

B. There are 2 overloaded sort methods. One takes one parameter, the other one two.

This is correct. The sort method has two overloaded versions: one that takes a single List parameter and sorts it in ascending order, and another that accepts a List and a Comparator as parameters, allowing you to define the sorting order (e.g., reverse order).

C. Sort returns nothing but it changes the collection that was passed as an argument

This is accurate. The sort method modifies the collection directly, and it has a void return type, meaning it does not return a sorted collection but instead sorts the original collection in place.

D. The second parameter lets you define how the collection should be sorted - for example in reverse order

This is correct. When using the overloaded sort method with two parameters, the second parameter is a Comparator that lets you specify custom sorting logic, including sorting in reverse order or any other defined order.

Correct Answer

A. A Queue follows First In, First Out (FIFO).

Explanation

A Queue operates on a First In, First Out (FIFO) principle, meaning that the first element added is the first one to be removed. This is the defining characteristic of queues and distinguishes them from stacks, which operate on a Last In, First Out (LIFO) basis. Queues are ideal for scheduling and managing tasks in the order they arrive.

Why other options are wrong

B. A Queue allows random access to its elements

This is incorrect because queues do not allow random access. Access is restricted to the front (for removal) and the rear (for insertion). Random access is a characteristic of structures like arrays or lists, not queues.

C. A Stack allows only sequential access from the top

While this statement is true about stacks, it does not address the distinguishing feature of a queue. The question specifically asks about what sets a queue apart, not a stack. Hence, this answer does not directly satisfy the question’s requirement.

D. A Queue follows Last In, First Out (LIFO)

This is incorrect because LIFO is the behavior of a stack, not a queue. A queue’s structure is designed to process elements in the order they arrive, which is FIFO, making this answer fundamentally incorrect.

Correct Answer

C. A LinkedHashMap that preserves the order of insertion

Explanation

A LinkedHashMap created using the default constructor preserves the order in which elements are inserted. This means that the iteration order of the map will be the same as the order in which the key-value pairs were added to it. It does not sort the elements by default nor does it allow duplicate keys, as the keys must remain unique.

Why other options are wrong

A. A LinkedHashMap that maintains elements in their natural order

This is incorrect. A LinkedHashMap does not sort its elements by their natural order; it only preserves the order of insertion. To sort elements, you would need a TreeMap or another sorting mechanism.

B. A LinkedHashMap that allows duplicate keys

This is incorrect. LinkedHashMap does not allow duplicate keys. Keys in a LinkedHashMap must be unique, and adding a key that already exists will update its associated value.

D. A LinkedHashMap that sorts elements based on a comparator

This is incorrect. A LinkedHashMap does not sort its elements based on a comparator. If sorting is required, a TreeMap or similar class would be used instead.

Correct Answer

A. Stack

Explanation

Depth-first search (DFS) uses a stack to explore as deeply as possible along each branch before backtracking. A stack allows the algorithm to "remember" the current path and backtrack when necessary, making it ideal for DFS traversal of graphs.

Why other options are wrong

B. Queue

This is incorrect because a queue is used in breadth-first search (BFS), where nodes are explored level by level, not deep first.

C. Priority queue

This is incorrect because a priority queue is generally used for algorithms like Dijkstra’s, where elements are processed based on priority rather than the order of exploration.

D. Tree

This is incorrect because a tree is a type of data structure used to organize data, but it’s not used to implement DFS directly. DFS is a graph traversal algorithm, and stacks are used for that.

Correct Answer

D. An object that stores a group of other objects, called its elements

Explanation

In Java, a Collection is an object that stores a group of elements, which are typically objects. The Java Collections Framework provides several interfaces (e.g., List, Set, Queue) and classes (e.g., ArrayList, HashSet, LinkedList) that allow us to store and manipulate these collections of objects. Collections do not store primitive types like int or char, but instead store objects.

Why other options are wrong

A. An array that stores a group of user-inputted variables, called its elements

This is incorrect because collections in Java are not arrays. Collections are more flexible and can dynamically resize and manage objects, whereas arrays have a fixed size.

B. An array that stores a group of objects, called its elements

This is incorrect because although arrays can store objects, they are not part of the Collection framework. The Collection framework is designed to provide more powerful and flexible ways to manage groups of objects.

C. An object that stores a group of user-inputted variables, called its elements

This is incorrect because Collection objects store groups of objects (instances of classes), not just any type of user-inputted variables. The elements in a collection are objects, not raw input variables.

E. None of the Above

This is incorrect because the correct description of a Collection is provided in option D.

Correct Answer

C. Comparator

Explanation

When creating a sorted list, such as a SortedABList, an application can provide a Comparator to define how the elements should be ordered. The Comparator allows the user to specify a custom order, different from the natural ordering (which is defined by the Comparable interface). This gives greater flexibility when sorting elements, especially if the elements do not implement Comparable or if a different sorting order is desired.

Why other options are wrong

A. Iterator

An Iterator is used to iterate over the elements of a collection, but it does not define any ordering of the elements. It simply allows traversal.

B. Iterable

An Iterable defines the ability to iterate over a collection, but it does not specify how the elements should be ordered. The ordering of elements is handled by the collection's implementation (e.g., using a Comparator or Comparable).

D. Comparable

The Comparable interface defines the natural ordering of elements within a class, but it does not allow for custom sorting. It is a mechanism for elements that can compare themselves. A Comparator is used when a custom order is needed.

E. None of these is correct

This is incorrect because the Comparator is the correct answer for passing a custom order to the constructor of a SortedABList.

Correct Answer

D. It enables the traversal of a Collection class, such as a Set.

Explanation

An Iterator is an interface that allows you to traverse through the elements of a collection, like a Set, List, or Queue. It does not work specifically with Map objects, as maps require separate iterators for their keys, values, or key-value pairs. The Iterator interface provides methods like hasNext() and next() to access elements sequentially.

Why other options are wrong

A. It enables the traversal of a Map.

This is incorrect. While Map objects do have iterators (through their entry set, key set, or value collection), the Iterator itself does not specifically enable traversal of a Map. You need specific iterators for Map entries or keys, such as Map.Entry iterators.

B. It is a class in the Collection hierarchy.

This is incorrect. Iterator is an interface, not a class, in the Java Collections Framework. It provides a standardized way to iterate over elements in a collection.

C. It compares two objects.

This is incorrect. An Iterator does not compare objects. Its primary function is to traverse a collection and access elements one by one.

Correct Answer

E. all of the above

Explanation

All of the listed statements are accurate characteristics of lists in programming. Lists are dynamic structures, meaning they can grow and shrink as needed. They hold sequences of items in a single object, making them ideal for managing collections of data. Lists also offer many useful methods like append(), remove(), and sort() that make them versatile. Access to individual elements is made easy through indexing, which allows direct access by position.

Why other options are wrong

A. lists will grow and shrink as needed

This statement is true, but it only covers one aspect of list functionality. It fails to reflect the full scope of what lists offer, such as their method support and indexing capabilities.

B. a list is a sequence of items stored as a single object

This is accurate, but it is not the complete answer. It doesn't consider the list's dynamic size and available methods.

C. lists support many convenient and frequently used methods

Correct, but incomplete on its own. It omits the list’s capacity to grow dynamically, store items as a single object, and allow indexing.

D. items in a list can be accessed by indexing

This is true, but only one feature of lists. It overlooks the dynamic nature, method support, and sequence encapsulation.