
- •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
You compare the CGPA of the arguments s1 and s2 by (re)using the compareTo() method from the Double class. You didn’t change anything in the main() method except for the way you call the sort() method. You create a new CGPAComparator() object and pass as the second argument to the sort() method. By default sort() uses the
compareTo() method; since you are passing a Comparator object explicitly, it now uses the compare() method defined in the CGPAComparator. So, the Student objects are now compared and sorted based on their CGPA.
You’ve learned quite a lot about the differences between the Comparable and Comparator interfaces, summarized in Table 6-9.
Table 6-9. Differences between Implementing Comparable and Comparator Interfaces
Comparable Interface |
Comparator Interface |
Used when the objects need to be compared in their natural order.
You do not create a separate class just to implement the Comparable interface.
For a given class type, you have only that class (and that class alone) implementing the Comparable interface.
The method in the Comparable interface is declared as int compareTo(ClassType type);.
Used when the objects need to be compared in custom user-defined order (other than the natural order).
You create a separate class just to implement the Comparator interface.
You can have many separate (i.e., independent) classes implementing the Comparator interface, with each class defining different ways to compare objects.
The method in the Comparator interface is declared as int compare(ClassType type1, ClassType type2);.
Most classes have a natural order for comparing objects, so implement the Comparable interface for your classes in those cases. If you want to compare the objects other than the natural order or if there is no natural ordering present for your class type, then create separate classes implementing the Comparator interface.
Algorithms (Collections Class)
You’ve seen two important components of the collections framework: abstract classes/interfaces and the concrete class implementations. The collections framework also has a utility class named Collections (note the suffix “s” in the class name). It provides algorithms that are useful for manipulating data structures provided in the collections framework. You’ll see important methods like sort(), binarySearch(), reverse(), shuffle(), etc., in this short section (check Table 6-10).
192

Chapter 6 ■ Generics and Collections
Table 6-10. Important Algorithms (Static Methods in the Collections Class)
Method |
Short Description |
int binarySearch(List<? extends Comparable<? super T>> list, T key)
void copy(List<? super T> dest, List<? extends T> src)
Looks for the key in List. If found, it returns a value >= 0; otherwise it returns a negative value. It has an overloaded version that also takes a Comparator object for comparing elements.
Copies all the elements from src List to dest List.
void fill(List<? super T> list, T obj)
T max(Collection<? extends T> coll)
Fills the whole list with the value obj.
Returns the max element in the list. It has an overloaded version that also takes a Comparator object for comparing elements.
T min(Collection<? extends T> coll)
Returns the min element in the list. It has an overloaded version that also takes a Comparator object for comparing elements.
boolean replaceAll(List<T> list, |
Replaces all occurrences of oldVal with newVal in list. |
T oldVal, T newVal) |
|
void reverse(List<?> list) |
Reverses all the elements in the given list. |
void rotate(List<?> list, int distance) |
Rotates the list given by the value distance. |
void shuffle(List<?> list) |
Shuffles elements in the list randomly. |
void sort(List<T> list) |
Sorts the list in its natural order (i.e., by using the compareTo() |
|
method). It has an overloaded version that also takes a |
|
Comparator object for comparing elements. |
void swap(List<?> list, int i, int j) |
Swaps the elements in the positions i and j in the list. |
|
|
Assume that you are creating a playlist of your favorite Michael Jackson songs. There are many things that you can do with a playlist: you can sort, shuffle, search, reverse, or replay songs. Let’s do all these in a PlayList program (see Listing 6-25).
Listing 6-25. PlayList.java
// This program demonstrates some of the useful methods in Collections class
import java.util.*;
class PlayList {
public static void main(String []args) {
// let's create a list of some Michael Jackson's songs List<String> playList = new LinkedList<String>(); playList.add("Rock With You - 1979"); playList.add("Billie Jean - 1983");
playList.add("Man In the Mirror - 1988"); playList.add("Black Or White - 1991");
System.out.println("The original playlist of MJ's songs"); System.out.println(playList);
193
Chapter 6 ■ Generics and Collections
System.out.println("\nThe reversed playlist"); Collections.reverse(playList); System.out.println(playList);
System.out.println("\nNow after shuffling the playlist"); Collections.shuffle(playList); System.out.println(playList);
System.out.println("\nSort the songs by their names "); Collections.sort(playList); System.out.println(playList);
System.out.println("\nIs my most favourite song Black Or White - 1991 present in the list?");
String backOrWhiteSong = "Black Or White - 1991";
int index = Collections.binarySearch(playList, backOrWhiteSong); if(index >= 0)
System.out.printf("Yes, its the %d song \n", (index + 1));
else
System.out.printf("No, its not there in the playlist \n");
System.out.println("\nLet me forward by two songs (rotate the list) "); Collections.rotate(playList, 2);
System.out.println(playList);
}
}
It prints the following:
The original playlist of MJ's songs
[Rock With You - 1979, Billie Jean - 1983, Man In the Mirror - 1988, Black Or White - 1991]
The reversed playlist
[Black Or White - 1991, Man In the Mirror - 1988, Billie Jean - 1983, Rock With You - 1979]
Now after shuffling the playlist
[Black Or White - 1991, Man In the Mirror - 1988, Rock With You - 1979, Billie J ean - 1983]
Sort the songs by their names
[Billie Jean - 1983, Black Or White - 1991, Man In the Mirror - 1988, Rock With You - 1979]
Is my most favourite song Black Or White - 1991 present in the list? Yes, its the 2 song
Let me forward by two songs (rotate the list)
[Man In the Mirror - 1988, Rock With You - 1979, Billie Jean - 1983, Black Or White - 1991]
194