
- •Contents at a Glance
- •Contents
- •About the Authors
- •About the Technical Reviewer
- •Acknowledgments
- •Introduction
- •Oracle Java Certifications: Overview
- •FAQ 1. What are the different levels of Oracle Java certification exams?
- •FAQ 4. Is OCPJP 7 prerequisite for other Oracle certification exams?
- •FAQ 5. Should I take the OCPJP 7 or OCPJP 6 exam?
- •The OCPJP 7 Exam
- •FAQ 7. How many questions are there in the OCPJP 7 exam?
- •FAQ 8. What is the duration of the OCPJP 7 exam?
- •FAQ 9. What is the cost of the OCPJP 7 exam?
- •FAQ 10. What are the passing scores for the OCPJP 7 exam?
- •FAQ 11. What kinds of questions are asked in the OCPJP 7 exam?
- •FAQ 12. What does the OCPJP 7 exam test for?
- •FAQ 13. I’ve been a Java programmer for last five years. Do I have to prepare for the OCPJP 7 exam?
- •FAQ 14. How do I prepare for the OCPJP 7 exam?
- •FAQ 15. How do I know when I’m ready to take the OCPJP 7 exam?
- •Taking the OCPJP 7 Exam
- •FAQ 16. What are my options to register for the exam?
- •FAQ 17. How do I register for the exam, schedule a day and time for taking the exam, and appear for the exam?
- •The OCPJP 7 Exam: Pretest
- •Answers with Explanations
- •Post-Pretest Evaluation
- •Essentials of OOP
- •FunPaint Application: An Example
- •Foundations of OOP
- •Abstraction
- •Encapsulation
- •Inheritance
- •Polymorphism
- •Class Fundamentals
- •Object Creation
- •Constructors
- •Access Modifiers
- •Public Access Modifier
- •Private Access Modifier
- •Protected and Default Access Modifier
- •Overloading
- •Method Overloading
- •Constructor Overloading
- •Overload resolution
- •Points to Remember
- •Inheritance
- •Runtime Polymorphism
- •An Example
- •Overriding Issues
- •Overriding: Deeper Dive
- •Invoking Superclass Methods
- •Type Conversions
- •Upcasts and Downcasts
- •Casting Between Inconvertible Types
- •Using “instanceof” for Safe Downcasts
- •Java Packages
- •Working with Packages
- •Static Import
- •Summary
- •Abstract Classes
- •Points to Remember
- •Using the “final” Keyword
- •Final Classes
- •Final Methods and Variables
- •Points to Remember
- •Using the “static” Keyword
- •Static Block
- •Points to Remember
- •Flavors of Nested Classes
- •Static Nested Classes (or Interfaces)
- •Points to Remember
- •Inner Classes
- •Points to Remember
- •Local Inner Classes
- •Points to Remember
- •Anonymous Inner Classes
- •Points to Remember
- •Enum Data Types
- •Points to Remember
- •Summary
- •Interfaces
- •Declaring and Using Interfaces
- •Points to Remember
- •Abstract Classes vs. Interfaces
- •Choosing Between an Abstract Class and an Interface
- •Object Composition
- •Composition vs. Inheritance
- •Points to Remember
- •Design Patterns
- •The Singleton Design Pattern
- •Ensuring That Your Singleton Is Indeed a Singleton
- •The Factory Design Pattern
- •Differences Between Factory and Abstract Factory Design Patterns
- •The Data Access Object (DAO) Design Pattern
- •Points to Remember
- •Summary
- •Generics
- •Using Object Type and Type Safety
- •Using the Object Class vs. Generics
- •Container Implementation Using the Object Class
- •Container Implementation Using Generics
- •Creating Generic Classes
- •Diamond Syntax
- •Interoperability of Raw Types and Generic Types
- •Generic Methods
- •Generics and Subtyping
- •Wildcard Parameters
- •Limitations of Wildcards
- •Bounded Wildcards
- •Wildcards in the Collections Class
- •Points to Remember
- •The Collections Framework
- •Why Reusable Classes?
- •Basic Components of the Collections Framework
- •Abstract Classes and Interfaces
- •Concrete Classes
- •List Classes
- •ArrayList Class
- •The ListIterator Interface
- •The LinkedList Class
- •The Set Interface
- •The HashSet Class
- •The TreeSet Class
- •The Map Interface
- •The HashMap Class
- •Overriding the hashCode() Method
- •The NavigableMap Interface
- •The Queue Interface
- •The Deque Interface
- •Comparable and Comparator Interfaces
- •Algorithms (Collections Class)
- •The Arrays Class
- •Methods in the Arrays Class
- •Array as a List
- •Points to Remember
- •Summary
- •Generics
- •Collections Framework
- •Processing Strings
- •String Searching
- •The IndexOf() Method
- •The regionMatches() Method
- •String Parsing
- •String Conversions
- •The Split() Method
- •Regular Expressions
- •Understanding regex Symbols
- •Regex Support in Java
- •Searching and Parsing with regex
- •Replacing Strings with regex
- •String Formatting
- •Format Specifiers
- •Points to Remember
- •Summary
- •Reading and Writing from Console
- •Understanding the Console Class
- •Formatted I/O with the Console Class
- •Special Character Handling in the Console Class
- •Using Streams to Read and Write Files
- •Character Streams and Byte Streams
- •Character Streams
- •Reading Text Files
- •Reading and Writing Text Files
- •“Tokenizing” Text
- •Byte Streams
- •Reading a Byte Stream
- •Data Streams
- •Writing to and Reading from Object Streams: Serialization
- •Serialization: Some More Details
- •Points to Remember
- •Summary
- •A Quick History of I/O APIs
- •Using the Path Interface
- •Getting Path Information
- •Comparing Two Paths
- •Using the Files Class
- •Checking File Properties and Metadata
- •Copying a File
- •Moving a File
- •Deleting a File
- •Walking a File Tree
- •Revisiting File Copy
- •Finding a File
- •Watching a Directory for Changes
- •Points to Remember
- •Summary
- •Introduction to JDBC
- •The Architecture of JDBC
- •Two-Tier and Three-Tier JDBC Architecture
- •Types of JDBC Drivers
- •Setting Up the Database
- •Connecting to a Database Using a JDBC Driver
- •The Connection Interface
- •Connecting to the Database
- •Statement
- •ResultSet
- •Querying the Database
- •Updating the Database
- •Getting the Database Metadata
- •Points to Remember
- •Querying and Updating the Database
- •Performing Transactions
- •Rolling Back Database Operations
- •The RowSet Interface
- •Points to Remember
- •Summary
- •Define the Layout of the JDBC API
- •Connect to a Database by Using a JDBC driver
- •Update and Query a Database
- •Customize the Transaction Behavior of JDBC and Commit Transactions
- •Use the JDBC 4.1 RowSetProvider, RowSetFactory, and RowSet Interfaces
- •Introduction to Exception Handling
- •Throwing Exceptions
- •Unhandled Exceptions
- •Try and Catch Statements
- •Programmatically Accessing the Stack Trace
- •Multiple Catch Blocks
- •Multi-Catch Blocks
- •General Catch Handlers
- •Finally Blocks
- •Points to Remember
- •Try-with-Resources
- •Closing Multiple Resources
- •Points to Remember
- •Exception Types
- •The Exception Class
- •The RuntimeException Class
- •The Error Class
- •The Throws Clause
- •Method Overriding and the Throws Clause
- •Points to Remember
- •Custom Exceptions
- •Assertions
- •Assert Statement
- •How Not to Use Asserts
- •Summary
- •Introduction
- •Locales
- •The Locale Class
- •Getting Locale Details
- •Resource Bundles
- •Using PropertyResourceBundle
- •Using ListResourceBundle
- •Loading a Resource Bundle
- •Naming Convention for Resource Bundles
- •Formatting for Local Culture
- •The NumberFormat Class
- •The Currency Class
- •The DateFormat Class
- •The SimpleDateFormat Class
- •Points to Remember
- •Summary
- •Introduction to Concurrent Programming
- •Important Threading-Related Methods
- •Creating Threads
- •Extending the Thread Class
- •Implementing the Runnable Interface
- •The Start( ) and Run( ) Methods
- •Thread Name, Priority, and Group
- •Using the Thread.sleep() Method
- •Using Thread’s Join Method
- •Asynchronous Execution
- •The States of a Thread
- •Two States in “Runnable” State
- •Concurrent Access Problems
- •Data Races
- •Thread Synchronization
- •Synchronized Blocks
- •Synchronized Methods
- •Synchronized Blocks vs. Synchronized Methods
- •Deadlocks
- •Other Threading Problems
- •Livelocks
- •Lock Starvation
- •The Wait/Notify Mechanism
- •Let’s Solve a Problem
- •More Thread States
- •timed_waiting and blocked States
- •waiting State
- •Using Thread.State enum
- •Understanding IllegalThreadStateException
- •Summary
- •Using java.util.concurrent Collections
- •Semaphore
- •CountDownLatch
- •Exchanger
- •CyclicBarrier
- •Phaser
- •Concurrent Collections
- •Apply Atomic Variables and Locks
- •Atomic Variables
- •Locks
- •Conditions
- •Multiple Conditions on a Lock
- •Use Executors and ThreadPools
- •Executor
- •Callable, Executors, ExecutorService, ThreadPool, and Future
- •ThreadFactory
- •The ThreadLocalRandom Class
- •TimeUnit Enumeration
- •Use the Parallel Fork/Join Framework
- •Useful Classes of the Fork/Join Framework
- •Using the Fork/Join Framework
- •Points to Remember
- •Summary
- •Using java.util.concurrent Collections
- •Applying Atomic Variables and Locks
- •Using Executors and ThreadPools
- •Using the Parallel Fork/Join Framework
- •Chapter 3: Java Class Design
- •Chapter 4: Advanced Class Design
- •Chapter 5: Object-Oriented Design Principles
- •Chapter 6: Generics and Collections
- •Chapter 7: String Processing
- •Chapter 8: Java I/O Fundamentals
- •Chapter 9: Java File I/O (NIO.2)
- •Chapter 10: Building Database Applications with JDBC
- •Chapter 11: Exceptions and Assertions
- •Chapter 12: Localization
- •Chapter 13: Threads
- •Chapter 14: Concurrency
- •OCPJP7 Exam (1Z0-804 a.k.a. Java SE 7 Programmer II) Topics
- •OCPJP 7 Exam (1Z0-805, a.k.a. Upgrade to Java SE 7 Programmer) Topics
- •Answers and Explanations
- •Answer Sheet
- •Answers and Explanations
- •Index

Chapter 6 ■ Generics and Collections
There are many old java.util classes (now known as legacy collection types) that were superceded by new collection classes. Some of them are (with newer types in parentheses): Enumeration (Iterator),
Vector (ArrayList), Dictionary (Map), and Hashtable (HashMap). In addition, Stack and Properties are legacy classes that do not have direct replacements.
The Iterator Interface
Let’s discuss Iterator first since we will be using Iterator to illustrate other concrete classes. The Iterator interface is a simple interface with only three methods: hasNext(), next(), and remove() (see Table 6-5).
Table 6-5. Methods in the Iterator Interface
|
|
Method |
Short Description |
boolean hasNext() |
Checks if the iterator has more elements to traverse. |
E next() |
Moves the iterator to the next element and returns that (next) element. |
void remove() |
Removes the last visited element from the underlying container. next() should have been |
|
called before calling remove(); otherwise it will throw an IllegalStateException. |
|
|
List Classes
Lists are used for storing a sequence of elements. You can insert an element of the container in a specific position using an index, and retrieve the same element later (i.e., it maintains the insertion order). You can store duplicate elements in a list. There are two concrete classes that you need to know: ArrayList and LinkedList.
ArrayList Class
ArrayList implements a resizable array. When you create a native array (say, new String[10];), the size of the array is known (fixed) at the time of creation. However, ArrayList is a dynamic array: it can grow in size as required. Internally, an ArrayList allocates a block of memory and grows it as required. So, accessing array elements is very fast in an ArrayList. However, when you add or remove elements, internally the rest of the elements are copied; so addition/deletion of elements is a costly operation.
Here’s a simple example to visit elements in an ArrayList. You take an ArrayList and use the for-each construct for traversing a collection:
ArrayList<String> languageList = new ArrayList<>(); languageList.add("C");
languageList.add("C++");
languageList.add("Java");
for(String language : languageList) { System.out.println(language);
}
It prints the following:
C C++ Java
175
Chapter 6 ■ Generics and Collections
This for-each is equivalent to the following code, which explicitly uses an Iterator:
for(Iterator<String> languageIter = languageList.iterator(); languageIter.hasNext();) { String language = languageIter.next();
System.out.println(language);
}
This code segment will also print the same output as the previous for-each loop code. Here is a step-by-step description of how this for loop works:
1.You use the iterator() method to get the iterator for that container. Since languageList is an ArrayList of type <String>, you should create Iterator with String. Name it languageIter.
2.Before entering the loop, you check if there are any elements to visit. You call the hasNext() method for checking that. If it returns true, there are more elements to visit; if it returns false, the iteration is over and you exit the loop.
3.Once you enter the body of the loop, the first thing you have to do is call next() and move the iterator. The next() method returns the iterated value. You capture that return value in the language variable.
4.You print the language value, and then the loop continues.
This iteration idiom—the way you call iterator(), hasNext(), and next() methods—is important to learn; we’ll be using either the for-each loop or this idiom extensively in our examples.
Note that you create ArrayList<String> and Iterator<String> instead of just using ArrayList or Iterator
(i.e., you provide type information along with these classes). The Collection classes are generic classes; therefore you need to specify the type parameters to use them. Here you are storing/iterating a list of strings, so you use <String>.
You can remove elements while traversing a container using iterators. Let’s create an object of ArrayList<Integer> type with ten elements. You’ll iterate over the elements and remove all of them (instead of using the removeAll() method in ArrayList). Listing 6-14 shows the code. Will it work?
Listing 6-14. TestIterator.java
// This program shows the usage of Iterator
import java.util.*;
class TestIterator {
public static void main(String []args) { ArrayList<Integer> nums = new ArrayList<Integer>(); for(int i = 1; i < 10; i++)
nums.add(i); System.out.println("Original list " + nums); Iterator<Integer> numsIter = nums.iterator(); while(numsIter.hasNext()) {
numsIter.remove();
}
System.out.println("List after removing all elements" + nums);
}
}
176

Chapter 6 ■ Generics and Collections
It prints the following:
Original list [1, 2, 3, 4, 5, 6, 7, 8, 9]
Exception in thread "main" java.lang.IllegalStateException
at java.util.AbstractList$Itr.remove(AbstractList.java:356) at TestIterator.main(Main.java:12)
Oops! What happened? The problem is that you haven’t called next() before calling remove(). Checking hasNext() in the while loop condition, moving to the element using next(), and calling remove() is the correct idiom for removing an element. If you don’t follow it correctly, you can get into trouble (i.e., you’ll get
IllegalStateException). Similarly, if you call remove() twice without sandwiching a next() between the statements, you’ll get this exception.
Let’s fix this program by calling next() before calling remove(). Here is the relevant part of the code:
Iterator<Integer> numsIter = nums.iterator(); while(numsIter.hasNext()) {
numsIter.next();
numsIter.remove();
}
System.out.println("List after removing all elements " + nums);
It prints the list with no elements, as expected:
List after removing all elements []
Remember that next() needs to be called before calling remove() in an Iterator; otherwise, you’ll get an IllegalStateException. Similarly, calling remove() in subsequent statements without calling next() between these statements will also result in this exception. Basically, any modifications to the underlying container while an iterator is traversing through the container will result in this exception.
The ListIterator Interface
You should understand ListIterator first before you look at LinkedList. The ListIterator interface extends the Iterator interface, so it inherits the methods hasNext(), next(), and remove(). Additionally, ListIterator has many other methods (see Table 6-6). Using these methods, you can traverse in the reverse direction, get the previous or next index position, and set or add new elements to the underlying container.
Table 6-6. Methods in the ListIterator Interface (in Addition to Iterator Methods)
|
|
Method |
Short Description |
boolean hasPrevious() |
Checks if the iterator has more elements to traverse in reverse direction. |
Element previous() |
Moves the iterator to the next element and returns that (next) element in reverse direction. |
int nextIndex() |
Returns the index of the next element in the iteration in forward direction. |
int previousIndex() |
Returns the index of the next element in the iteration in reverse direction. |
void set(Element) |
Sets the last element visited (using next or previous); it replaces the existing element. |
void add(Element) |
Adds the element into the list at the current iteration position. |
|
|
177
Chapter 6 ■ GeneriCs and ColleCtions
The LinkedList Class
The LinkedList class internally uses a doubly-linked list. So, insertion and deletion is very fast in LinkedList. However, accessing an element entails traversing the nodes one-by-one, so it is slow. When you want to add or remove elements frequently in a list of elements, it is better to use a LinkedList. You’ll see an example of LinkedList together with the ListIterator interface.
A palindrome is a word or phrase that reads the same forward and backward. A palindrome string “abcba” reads the same in both directions. Given a string, how can you determine whether the string is a palindrome or not?
Well, you can determine whether an input string is a palindrome or not by storing the input string in a String and using the charAt() method in a for loop to compare characters (one from the start and another from the end). To show you how to use ListIterator and LinkedList, see Listing 6-15 for a contrived solution that does the same thing.
Listing 6-15. ListIterator.java
// This program demonstrates the usage of ListIterator
import java.util.*;
class ListIteratorTest {
public static void main(String []args) { String palStr = "abcba";
List<Character> palindrome = new LinkedList<Character>();
for(char ch : palStr.toCharArray()) palindrome.add(ch);
System.out.println("Input string is: " + palStr); ListIterator<Character> iterator = palindrome.listIterator();
ListIterator<Character> revIterator = palindrome.listIterator (palindrome.size());
boolean result = true;
while(revIterator.hasPrevious() && iterator.hasNext()) { if(iterator.next() != revIterator.previous()){
result = false; break;
}
}
if (result)
System.out.print("Input string is a palindrome");
else
System.out.print("Input string is not a palindrome");
}
}
It prints the following:
Input string is: abcba
Input string is a palindrome
178