ITSW 3173 D287 Java Frameworks

Correct Answer

A. A collection of key/value pairs in which each key is associated with a corresponding value

Explanation

In Java, a Map is a part of the Collections Framework used to store data in the form of key-value pairs. Each key in a Map must be unique, and each key maps to exactly one value. This allows for efficient retrieval and updating of values based on their associated keys.

Why other options are wrong

B. An ordered collection of elements, often accessed by integer indexes or by iteration

This is incorrect because it describes a List, not a Map. Lists, such as ArrayList or LinkedList, maintain insertion order and allow indexed access, which is not how a Map functions.

C. A collection in which elements are removed in the same order in which they were added

This describes a queue-like structure, specifically a FIFO (First-In-First-Out) data structure such as Queue or LinkedList. It does not reflect how a Map operates, where ordering (if any) depends on the implementation and elements are accessed by key, not by order of insertion.

D. A collection of integers that are associated with an array of the corresponding value

This is incorrect because it is not a proper definition of a Map in Java. A Map can have any object type as keys and values—not just integers or arrays. This option also confuses arrays with key-value mappings, which are entirely different structures.

Correct Answer

C. To associate keys with values

Explanation

The Map interface in Java is designed to store key-value pairs, where each key is associated with exactly one value. It enables efficient retrieval, insertion, and deletion of elements based on the key. This makes Map ideal for scenarios requiring quick access to data using identifiers, like lookup tables.

Why other options are wrong

A. To store elements in a sorted order

This is incorrect because sorting is not the primary function of a Map. While some implementations like TreeMap do store entries in a sorted order based on keys, the core purpose of the Map interface is to associate keys with values, not to maintain order.

B. To maintain a collection of unique elements

This is incorrect because the Set interface is specifically designed for maintaining a collection of unique elements. In a Map, uniqueness is enforced only on keys, not on values. Duplicate values are allowed, so this option does not accurately describe a Map.

D. To allow duplicate entries

This is incorrect because Map does not allow duplicate keys. Although it allows duplicate values, the uniqueness of keys is a fundamental characteristic of Map. This option could be misleading and doesn't describe the primary function of a Map.

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.

Correct Answer

A. pop()

Explanation

The pop() method is used in a stack to remove and return the top element. In a stack, this is the primary method for removing elements, adhering to the "last in, first out" (LIFO) principle.

Why other options are wrong

B. isEmpty()

This is incorrect because isEmpty() simply checks whether the stack is empty, but it does not remove any elements.

C. peek()

This is incorrect because peek() returns the top element of the stack without removing it. It allows you to view the top element but does not perform a removal.

D. push()

This is incorrect because push() adds an element to the top of the stack. It does not remove any elements.

Correct Answer

D. Vector

Explanation

The Vector class in Java is synchronized, meaning that its methods for modifying elements (such as add(), remove(), and set()) are thread-safe. This ensures that only one thread can access and modify the vector at a time, which can be beneficial in multi-threaded environments. However, synchronization can lead to performance overhead compared to non-synchronized collections like ArrayList.

Why other options are wrong

A. ArrayList

This is incorrect because ArrayList is not synchronized. It is not thread-safe by default, so if multiple threads are accessing it concurrently, synchronization must be handled externally.

B. LinkedList

This is incorrect because LinkedList is also not synchronized. Like ArrayList, it is not thread-safe by default, and external synchronization is required if it is accessed by multiple threads.

C. Stack

This is incorrect because although Stack is part of the legacy collection classes, its methods are synchronized. However, Vector is the more commonly referenced synchronized collection in modern use. The distinction in the question specifically points to Vector as the synchronized collection.

Correct Answer

A. push() adds an element to the top of the stack, while isEmpty() checks if the stack has any elements.

Explanation

The push() method adds an element to the top of the stack, which is the primary function of the stack data structure. The isEmpty() method checks whether the stack is empty, returning true if there are no elements and false if the stack contains elements.

Why other options are wrong

B. push() removes the top element from the stack, while isEmpty() returns the top element.

This is incorrect because push() does not remove elements; it only adds elements to the top of the stack. The method for removing elements is pop(), not push(). Also, isEmpty() does not return the top element; it only checks if the stack is empty.

C. push() retrieves the top element without removing it, while isEmpty() adds an element to the stack.

This is incorrect because push() adds an element to the stack, not retrieves it. The method for retrieving the top element without removing it is peek(). Additionally, isEmpty() checks if the stack is empty; it does not add elements.

D. push() checks if the stack is full, while isEmpty() returns the number of elements in the stack.

This is incorrect because push() does not check if the stack is full. It adds elements to the stack, and isEmpty() only checks whether the stack is empty, not the number of elements in it.

Correct Answer

A. LinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder)

Explanation

To create a LinkedHashMap that maintains access order (meaning it reorders entries based on access, not just insertion), you must use the constructor with all three parameters: initial capacity, load factor, and a boolean flag for access order. When accessOrder is set to true, the map maintains access order rather than insertion order.

Why other options are wrong

B. LinkedHashMap(int initialCapacity)

This constructor allows setting only the initial capacity of the map. It does not offer control over access order, so the map will use the default (insertion order), not access order.

C. LinkedHashMap()

This no-argument constructor creates a LinkedHashMap with default capacity and load factor, and it maintains insertion order by default. It does not allow you to specify access order, which is essential for the behavior asked in the question.

D. LinkedHashMap(float loadFactor, boolean accessOrder)

This is incorrect because there is no such constructor in the LinkedHashMap class that takes only a float and a boolean as parameters. To specify access order, you must also provide the initial capacity.

Correct Answer

C. To return a reference to the top element of the stack, but leave it in place.

Explanation

The peek method in a stack returns a reference to the top element of the stack without removing it. It allows you to look at the element at the top of the stack without modifying the stack. This is useful when you need to examine the top item but not alter the structure of the stack.

Why other options are wrong

A. To return a reference to the top element of the stack, and remove it from the stack.

This is incorrect because it describes the behavior of the pop method, not peek. The pop method removes and returns the top element, while peek only returns the top element without removing it.

B. To return a reference to the bottom element of the stack, but leave it in place.

This is incorrect because a stack operates on the LIFO (Last In, First Out) principle, meaning only the top element is accessible directly, not the bottom. The peek method accesses the top element, not the bottom.

D. To return a reference to the top element of the stack, and move it to the bottom of the stack.

This is incorrect because the peek method does not modify the stack; it only returns the top element without changing the stack's order. Moving the element to the bottom would be a different operation.

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.