Chapter 1: Introduction to Computers Programs and JavaSection 1.2:
What is a Computer
Section 1.3:
Programming Languages
Section 1.4:
Operating Systems
Section 1.5:
Java, the World Wide Web, and Beyond
Section 1.6:
The Java Programming Specification
Section 1.7:
A Simple Java Program
Section 1.8:
Creating, Compiling, and Executing a Java Program
Chapter 2: Elementary ProgrammingSection 2.2:
Writing A Simple Program
Section 2.3:
Reading Input from the Console
Section 2.4:
Identifiers
Section 2.5:
Variables
Section 2.6:
Assignment Statements and Assignment Expressions
Section 2.8:
Naming Conventions
Section 2.9:
Numeric Data Types and Operations
Section 2.10:
Numeric Literals
Section 2.11:
Evaluating Expressions and Operator Precedence
Section 2.12:
Case Study: Displaying the Current Time
Section 2.13:
Augmented Assignment Operators
Section 2.14:
Increment and Decrement Operators
Section 2.15:
Numeric Type Conversions
Section 2.16:
Software Development Process
Section 2.17:
Case Study: Counting Monetary Units
Section 2.18:
Common Errors and Pitfalls
Section 3.2:
boolean Data
Section 3.3:
if Statements
Section 3.4:
Two Way if else Statements
Section 3.5:
Nested if and multiway if else Statements
Section 3.6:
Common Errors and Pitfalls
Section 3.7:
Generating Random Numbers
Section 3.9:
Case Study: Computing Body Mass Index
Section 3.10:
Logical Operators
Section 3.13:
switch Statements
Section 3.14:
Conditional Expressions
Section 3.15:
Operator Precedence and Associativity
Chapter 4: Mathematical Functions, Characters, and StringsSection 4.2:
Common Mathematical Functions
Section 4.3:
Character Data Types and Operations
Section 4.4:
The String Type
Section 4.5:
Case Studies
Section 4.6:
Formatting Console Output
Section 5.2:
The while Loop
Section 5.3:
The do while Loop
Section 5.4:
The for Loop
Section 5.5:
Which Loop for Use
Section 5.6:
Nested Loop
Section 5.8:
Case Studies
Section 5.9:
Keywords break And continue
Section 6.4:
void Method Example
Section 6.5:
Passing Arguments by Values
Section 6.8:
Overloading Methods
Section 6.9:
The Scope of Variables
Chapter 7: Single Dimensional ArraysSection 7.2:
Array Basics
Section 7.4:
Case Study: Deck of Cards
Section 7.5:
Copying Arrays
Section 7.7:
Returning an Array from a Method
Section 7.8:
Case Study: Counting the Occurences of Each Letter
Section 7.9:
Variable Length Argument Lists
Section 7.10:
Searching Arrays
Section 7.11:
Sorting Arrays
Section 7.12:
The Arrays Class
Section 7.13:
Command Line Arguments
Chapter 8: Multidimensional ArraysSection 8.2:
Two Dimensional Array Basics
Section 8.3:
Processing Two Dimensional Arrays
Section 8.4:
Passing Two Dimensional Arrays to Methods
Section 8.8:
Multidimensional Arrays
Chapter 9: Objects and ClassesSection 9.3:
Example: Defining Classes and Creating Objects
Section 9.4:
Constructing Objects Using Constructors
Section 9.5:
Accessing Objects via Reference Variables
Section 9.6:
Using Classes from the Java Library
Section 9.7:
Static Variables, Constants and Methods
Section 9.9:
Data Field Encapsulation
Section 9.10:
Passing Objects to Methods
Section 9.11:
Array of Objects
Section 9.12:
Immutable Objects and Classes
Section 9.13:
The Scope of Variables
Section 9.14:
The this Reference
Chapter 10: Object Oriented ThinkingSection 10.2:
Class Abstraction and Encapulation
Section 10.3:
Thinking in Objects
Section 10.4:
Class Relationships
Section 10.7:
Processing Primitive Data Type Values as Objects
Section 10.8:
Automatic Conversion between Primitive Types and Wrapper Class Types
Section 10.9:
The BigInteger and BigDecimal Classes
Section 10.10:
The String Class
Section 10.11:
The StringBuilder and StringBuffer Classes
Chapter 11: Inheritance and PolymorphismSection 11.2:
Superclasses and Subclasses
Section 11.3:
Using the super Keyword
Section 11.4:
Overriding Methods
Section 11.5:
Overriding vs Overloading
Section 11.8:
Dynamic Binding
Section 11.9:
Casting Objects and the instanceof Operator
Section 11.10:
The Object's equals Methods
Section 11.11:
The ArrayList Class
Section 11.12:
Useful Methods for Lists
Section 11.14:
The protected Data and Methods
Section 11.15:
Preventing Extending and Overriding
Chapter 12: Exception Handling and Text I/OSection 12.2:
Exception Handling Overview
Section 12.3:
Exception Types
Section 12.4:
More on Exception Handling
Section 12.5:
The finally Clause
Section 12.6:
When to Use Exceptions
Section 12.7:
Rethrowing Exceptions
Section 12.8:
Chained Exceptions
Section 12.9:
Defining Custom Exception Classes
Section 12.10:
The File Class
Section 12.11:
File Input and Output
Section 12.12:
Reading Data from the Web
Section 12.13:
Case Study: Web Crawler
Chapter 13: Abstract Classes and InterfacesSection 13.2:
Abstract Classes
Section 13.3:
Case Study: The Abstract Number Class
Section 13.4:
Case Study: Calendar and Gregorian Calendar
Section 13.5:
Interfaces
Section 13.6:
The Comparable Interface
Section 13.7:
The Cloneable Interface
Section 13.8:
Interfaces vs Abstract Classes
Section 13.9:
Case Study: The Rational Class
Section 13.10:
Class Design Guidelines
Section 14.2:
JavaFx vs Swing and AWT
Section 14.3:
The Basic Structure of a Java FX Program
Section 14.4:
Panes, UI Controls, and Shapes
Section 14.5:
Property Binding
Section 14.6:
Common Properties and Methods for Nodes
Section 14.7:
The Color Class
Section 14.8:
The Font Class
Section 14.9:
The Image and ImageView Classes
Section 14.10:
Layout Panes
Section 14.11:
Shapes
Chapter 15: Event Driven Programming and AnimationsSection 15.10:
Listeners for Observable Objects
Section 15.2:
Events and Event Sources
Section 15.3:
Registering Handlers and Handling Events
Section 15.4:
Inner Classes
Section 15.5:
Anonymous Inner Class Handlers
Section 15.6:
Simplifying Event Handling Using Lambda Expressions
Section 15.8:
Mouse Events
Section 15.9:
Key Events
Section 15.11:
Animation
Section 15.12:
Case Study: Bouncing Ball
Chapter 16: JavaFX UI Controls and MultimediaSection 16.2:
Labeled and Label
Section 16.3:
Button
Section 16.4:
CheckBox
Section 16.5:
RadioButton
Section 16.6:
TextField
Section 16.7:
TextArea
Section 16.8:
ComboBox
Section 16.9:
ListView
Section 16.10:
ScrollBar
Section 16.11:
Slider
Section 16.12:
Case Study: Developing a Tic Tac Toe Game
Section 16.13:
Video and Audio
Section 16.14:
Case Study: National Flags and Anthems
Section 17.2:
How is Text I/O Handled in Java
Section 17.3:
Text I/O vs Binary I/O
Section 17.4:
Binary I/O Classes
Section 17.5:
Case Study: Copying Files
Section 17.6:
Object I/O
Section 17.7:
Random Access Files
Section 18.2:
Case Study: Computing Factorials
Section 18.3:
Case Study: Computing Fibonacci Numbers
Section 18.4:
Problem Solving Using Recursion
Section 18.5:
Recursive Helper Methods
Section 18.6:
Case Study: Find the Directory Size
Section 18.7:
Case Study: Tower of Hanoi
Section 18.8:
Case Study: Fractals
Section 18.9:
Recursion vs Iteration
Section 18.10:
Tail Recursion
Section 19.2:
Motivations and Benefits
Section 19.3:
Defining Generic Classes and Interfaces
Section 19.4:
Generic Methods
Section 19.5:
Case Study: Sorting an Array of Objects
Section 19.6:
Raw Types and Backward Compatibility
Section 19.7:
Wildcard Generic Types
Section 19.8:
Erasure and Restrictions on Generics
Section 19.9:
Case Study: Generic Matrix Class
Chapter 20: Lists, Stacks, Queues, and Priority QueuesSection 20.2:
Collections
Section 20.3:
Iterators
Section 20.4:
Lists
Section 20.5:
The Comparator Interface
Section 20.6:
Static Methods for Lists and Collections
Section 20.7:
Case Study: Bouncing Balls
Section 20.8:
Vector and Stack Classes
Section 20.9:
Queues and Priority Queues
Section 20.10:
Case Study: Evaluating Expressions
Section 21.2:
Sets
Section 21.3:
Comparing the Performance of Sets and Lists
Section 21.4:
Case Study: Counting Keywords
Section 21.5:
Maps
Section 21.6:
Case Study: Occurences of Words
Section 21.7:
Singleton and Unmodifiable Collections and Maps
Exercise 3
Exercise 5
Exercise 7
Chapter 22: Developing Efficient AlgorithmsSection 22.2:
Measuring Algorithm Efficiency Using Big O Notation
Section 22.3:
Examples: Determining Big O
Section 22.4:
Analyzing Algorithm Time Complexity
Section 22.5:
Finding Fibonacci Numbers Using Dynamic Programming
Section 22.6:
Finding Greatest Common Divisors Using Euclid's AlgorithmSection 22.7:
Efficient Algorithms for Finding Prime NumbersSection 22.8:
Finding the Closest Pair of Points Using Divide and Conquer
Section 22.9:
Solving the Eight Queens Problem Using Backtracking
Section 22.10:
Computational Geometry: Finding a Convex Hull
Section 23.2:
Insertion Sort
Section 23.3:
Bubble Sort
Section 23.4:
Merge Sort
Section 23.5:
Quick Sort
Section 23.6:
Heap Sort
Section 23.7:
Bucket Sort and Radix Sort
Section 23.8:
External Sort
Chapter 24: Implementing Lists, Stacks, Queues, and Priority QueuesSection 24.2:
Common Features for Lists
Section 24.3:
Array Lists
Section 24.4:
Linked Lists
Section 24.5:
Stacks and Queues
Section 24.6:
Priority Queues
Chapter 25: Binary Search TreesSection 25.2:
Binary Search Trees
Section 25.3:
Deleting Elements from a BST
Section 25.4:
Tree Visualization and MVC
Section 25.5:
Iterators
Section 25.6:
Case Study: Data Compression
Section 26.2:
Rebalancing Trees
Section 26.3:
Designing Classes for AVL Trees
Section 26.4:
Overriding the insert Method
Section 26.6:
Implementing the delete Method
Section 26.7:
The AVLTree Class
Section 26.8:
Testing the AVLTree Class
Section 26.9:
AVL Tree Time Complexity Analysis
Section 27.2:
What is Hashing
Section 27.3:
Hash Functions and Hash Codes
Section 27.4:
Handling Collisions Using Open Addressing
Section 27.5:
Handling Collisions Using Separate Chaining
Section 27.6:
Load Factor and Rehashing
Section 27.7:
Implementing a Map Using Hashing
Chapter 28: Graphs and ApplicationsSection 28.2:
Basic Graph Terminologies
Section 28.3:
Representing Graphs
Section 28.4:
Modeling Graphs
Section 28.5:
Graph Visualization
Section 28.6:
Graph Traversals
Section 28.7:
Depth First Search
Section 28.8:
Case Study: The Connected Circles Problem
Section 28.9:
Breadth First Search
Section 28.10:
Case Study: The Nine Tails Problem
Chapter 29: Weighted Graphs and ApplicationsSection 29.2:
Representing Weighted Graphs
Section 29.3:
The WeightedGraph Class
Section 29.4:
Minimum Spanning Trees
Section 29.5:
Finding Shortest Paths
Section 29.6:
Case Study: The Weighted Nine Tails ProblemPage 1090:
Programming Exercises
Chapter 30: Multithreading and Parallel ProgrammingSection 30.2:
Thread Concepts
Section 30.3:
Creating Tasks and Threads
Section 30.4:
The Thread Class
Section 30.5:
Case Study: Flashing Text
Section 30.6:
Thread Pools
Section 30.7:
Thread Synchronization
Section 30.8:
Synchronization Using LocksSection 30.9:
Cooperation among Threads
Section 30.10:
Case Study: Producer/Consumer
Section 30.11:
Blocking Queues
Section 30.12:
Semaphores
Section 30.13:
Avoiding Deadlocks
Section 30.14:
Thread States
Section 30.15:
Synchronized Collections
Section 30.16:
Parallel Programming
Page 1134:
Programming Exercises
Section 31.2:
Client/Server Computing
Section 31.3:
The InetAddress Class
Section 31.4:
Serving Multiple Clients
Section 31.5:
Sending and Receiving Objects
Section 31.6:
Case Study: Distributed Tic-Tac-Toe Games
Page 1169:
Programming Exercises
Chapter 32: Java Database ProgrammingSection 32.2:
Relational Database Systems
Section 32.3:
SQL
Section 32.4:
JDBC
Section 32.5:
PreparedStatement
Section 32.6:
CallableStatement
Section 32.7:
Retrieving Metadata
Page 1207:
Programming Exercises
Chapter 33: JavaServer FacesSection 33.2:
Getting Started with JSF
Section 33.3:
JSF GUI Components
Section 33.4:
Processing the Form
Section 33.6:
Session Tracking
Section 33.7:
Validating Input
Page 1253:
Programming Exercises
Chapter Appendix F: Number SystemsCOMING SOON
At Quizlet, we’re giving you the tools you need to take on any subject without having to carry around solutions manuals or printing out PDFs! Now, with expert-verified solutions from Intro to Java Programming, Comprehensive Version 10th Edition, you’ll learn how to solve your toughest homework problems. Our resource for Intro to Java Programming, Comprehensive Version includes answers to chapter exercises, as well as detailed information to walk you through the process step by step. With Expert Solutions for thousands of practice problems, you can take the guesswork out of studying and move forward with confidence.
