8.9. Quick Review Questions

1. What is the difference between ArrayList and LinkedList?

ArrayList and LinkedList are both part of the Java Collections Framework, but they have different underlying data structures and performance characteristics. ArrayList uses a dynamic array to store elements, which allows for fast retrieval (accessing elements by index is quick) but can be slow for inserting or removing elements in the middle of the list because it may require shifting elements. In contrast, LinkedList uses a doubly linked list structure, which allows for fast insertion and deletion at both ends of the list; however, accessing elements by index is slower because it must traverse the list.

Think of an ArrayList as a bookshelf where each book is organized on a single shelf. If you want to add or remove a book in the middle, you have to take out all the books on top of it, which can take time. A LinkedList is more like a chain of people where each person holds the hand of the next. If you want to add someone in the middle, the people can easily accommodate that by holding hands differently without needing to reorganize everyone.

2. How does HashSet handle duplicates?

HashSet is designed to store unique elements and automatically handles duplicates. When you try to add an element to a HashSet, it checks whether that element is already present. If it is, the HashSet will not add the duplicate, ensuring that every element in the set is distinct. This feature makes HashSets useful when you want to keep a collection of non-repetitive items.

Imagine you have a box for collecting unique coins. Each time you want to add a coin, you check if you already have that coin in your box. If you do, you simply won't add it again. This box represents a HashSet, ensuring your collection only has one of each coin.

3. Which collection stores data in key-value pairs?

The collection that stores data in key-value pairs is the Map interface. Maps allow you to store items where each key is unique and linked to a specific value. For example, you can use a Map to store employee IDs as keys and employee names as values. This structure makes it easy to retrieve information based on the key.

Think of a Map like a classroom where each student has a unique student ID (the key). The student's name and other information are stored in a file that corresponds to that ID. If you want to find a student's information, you simply look up their ID; this saves time compared to searching through all the student files individually.

4. Why is Map not a subtype of Collection?

Map is not considered a subtype of Collection in Java because it is designed to handle pairs of elements—a unique key mapped to a value—rather than storing single elements like the Collection interface does. Collections deal with individual objects, while Maps deal with relationships between keys and values, hence differentiating their functionalities.

Imagine a library of books versus a librarian's card catalog. The card catalog (which functions like a Map) connects each book title (the key) with where it's located in the library (the value). Meanwhile, the collection of all the books themselves (which is like a Collection) just would list each book, without the context of where they belong.

5. What will happen if you add a duplicate value to a HashSet?

When you attempt to add a duplicate value to a HashSet, the operation will not succeed, and the HashSet will remain unchanged. This behavior ensures that all elements in the HashSet are unique, thereby preventing duplicates from being stored. The attempt to add the duplicate will simply be ignored.

Think about a club membership where each person has a unique member ID. If someone tries to register twice using the same ID, their application will be ignored because the club only allows one membership per ID. This is similar to how a HashSet functions with duplicates.

--