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 Language Specification, API, JDK, JRE, and IDE
Section 1.7:
A Simple Java Program
Section 1.8:
Creating, Compiling, and Executing a Java Program
Section 1.9:
Programming Style and Documentation
Section 1.10:
Programming Errors
Page 52:
Programming Exercises
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.7:
Named Constants
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
Page 91:
Programming Exercises
Section 3.2:
boolean Data Type
Section 3.3:
if Statements
Section 3.4:
Two-Way if-else Statements
Section 3.5:
Nested if and Multi-Way if-else Statements
Section 3.6:
Common Errors and Pitfalls
Section 3.7:
Generating Random Numbers
Section 3.9:
Case Study: Computing Taxes
Section 3.10:
Logical Operators
Section 3.11:
Case Study: Determining Leap Year
Section 3.12:
Case Study: Lottery
Section 3.13:
Switch Statements
Section 3.14:
Conditional Operators
Section 3.15:
Operator Precedence and Associativity
Page 130:
Programming Exercises
Chapter 4: Mathematical Functions, Characters, and StringsSection 4.2:
Common Mathematical Functions
Section 4.3:
Character Data Type and Operations
Section 4.4:
The String Type
Section 4.5:
Case Studies
Section 4.6:
Formatting Console Output
Page 172:
Programming Exercises
Exercise 1b
Exercise 1c
Exercise 1d
Exercise 1e
Exercise 1f
Exercise 1g
Exercise 1h
Exercise 1i
Exercise 1j
Exercise 1k
Exercise 1l
Exercise 1m
Exercise 1n
Exercise 1o
Exercise 1p
Exercise 1q
Exercise 1r
Section 5.2:
The while Loop
Section 5.3:
Case Study: Guessing Numbers
Section 5.4:
Loop Design Strategies
Section 5.5:
Controlling a Loop with User Confirmation or a Sentinel Value
Section 5.6:
The do-while Loop
Section 5.7:
The for Loop
Section 5.8:
Which Loop to Use?
Section 5.9:
Nested Loops
Section 5.11:
Case Studies
Section 5.12:
Keywords break and continue
Section 5.13:
Case Study: Checking Palindromes
Section 5.14:
Case Study: Displaying Prime Numbers
Page 216:
Programming Exercises
Section 6.4:
Void Vs. Value-Returning Methods
Section 6.5:
Passing Parameters by Values
Section 6.6:
Modularizing Code
Section 6.7:
Case Study: Converting Hexadecimals to Decimals
Section 6.8:
Overloading Methods
Section 6.9:
The Scope of Variables
Page 258:
Programming Exercises
Exercise 8b
Exercise 8c
Exercise 8d
Exercise 8e
Exercise 8f
Exercise 8g
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 Occurrences 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
Page 300:
Programming Exercises
Exercise 4b
Exercise 4c
Exercise 4d
Exercise 8b
Exercise 8c
Exercise 8d
Exercise 8e
Exercise 8f
Exercise 8g
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.5:
Case Study: Grading a Multiple-Choice Test
Section 8.6:
Case Study: Finding the Closest Pair
Section 8.7:
Case Study: Sudoku
Section 8.8:
Multidimensional Arrays
Page 329:
Programming Exercises
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.12:
Immutable Objects and Classes
Section 9.13:
The Scope of Variables
Section 9.14:
The this Reference
Page 384:
Programming Exercises
Chapter 10: Object-Oriented ThinkingSection 10.2:
Class Abstraction and Encapsulation
Section 10.3:
Thinking in Objects
Section 10.4:
Class Relationships
Section 10.5:
Case Study: Designing the Course Class
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
Page 423:
Programming Exercises
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
Page 447:
Check PointSection 11.8:
Dynamic Binding
Section 11.9:
Casting Objects and the instanceof Operator
Section 11.10:
The Object’s equals Method
Section 11.11:
The ArrayList Class
Section 11.12:
Useful Methods for Lists
Section 11.13:
Case Study: A Custom Stack Class
Section 11.14:
The protected Data and Methods
Section 11.15:
Preventing Extending and Overriding
Page 469:
Programming Exercises
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
Page 514:
Programming Exercises
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 GregorianCalendar
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
Page 557:
Programming Exercises
Exercise 1
Exercise 3b
Exercise 3c
Exercise 3d
Exercise 3e
Section 14.2:
JavaFX vs Swing and AWT
Section 14.3:
The Basic Structure of a JavaFX Program
Section 14.4:
Panes, Groups, 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 and Groups
Section 14.11:
Shapes
Section 14.12:
Case Study: The ClockPane Class
Page 608:
Programming Exercises
Chapter 15: Event-Driven Programming and AnimationsSection 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.10:
Listeners for Observable Objects
Section 15.11:
Animation
Section 15.12:
Case Study: Bouncing Ball
Section 15.13:
Case Study: US Map
Page 656:
Programming Exercises
Chapter 16: JAVAFX ui Controls and MultimediaSection 16.2:
Labeled and LabelSection 16.3:
ButtonSection 16.4:
CheckBoxSection 16.5:
RadioButtonSection 16.6:
TextFieldSection 16.7:
TextAreaSection 16.8:
ComboBoxSection 16.9:
ListViewSection 16.10:
ScrollBarSection 16.11:
SliderSection 16.12:
Case Study: Developing a Tic-Tac-Toe GameSection 16.13:
Video and AudioSection 16.14:
Case Study: National Flags and AnthemsPage 704:
Programming Exercises
Exercise 3
Exercise 4
Exercise 5
Exercise 6
Exercise 7
Exercise 8
Exercise 9
Exercise 10
Exercise 11
Exercise 12
Exercise 13
Exercise 14
Exercise 15
Exercise 16
Exercise 17
Exercise 18
Exercise 19
Exercise 20
Exercise 21
Exercise 22
Exercise 23
Exercise 24
Exercise 25
Exercise 26
Exercise 27
Exercise 28
Exercise 29
Exercise 30
Exercise 31
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
Page 737:
Programming Exercises
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: Finding 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:
Case Study: Counting the Occurrences of Each Letter
Page 764:
Programming Exercises
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
Page 794:
Programming Exercises
Chapter 20: Lists, Stacks, Queues, and Priority QueuesSection 20.2:
Collections
Section 20.3:
Iterators
Section 20.4:
Using the forEach Method
Section 20.5:
Lists
Section 20.6:
The Comparator Interface
Section 20.7:
Static Methods for Lists and Collections
Section 20.8:
Case Study: Bouncing Balls
Section 20.9:
Vector and Stack Classes
Section 20.10:
Queues and Priority Queues
Section 20.11:
Case Study: Evaluating Expressions
Page 830:
Programming Exercises
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: Occurrences of Words
Section 21.7:
Singleton and Unmodifiable Collections and Maps
Page 858:
Programming Exercises
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 Algorithm
Section 22.7:
Efficient Algorithms for Finding Prime Numbers
Section 22.8:
Finding the Closest Pair of Points Using
Section 22.9:
Solving the Eight Queens Problem Using BacktrackingSection 22.10:
Computational Geometry: Finding a Convex HullPage 893:
Programming Exercises
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 and Radix Sorts
Section 23.8:
External Sort
Page 933:
Programming Exercises
Chapter 24: Implementing Lists, Stacks, Queues, and Priority QueuesSection 24.2:
Common Operations for Lists
Section 24.3:
Array Lists
Section 24.4:
Linked Lists
Section 24.5:
Stacks and Queues
Section 24.6:
Priority Queues
Page 971:
Programming Exercises
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
Page 1006:
Programming Exercises
Section 26.2:
Rebalancing Trees
Section 26.3:
Designing Classes for AVL Trees
Section 26.4:
Overriding the insert Method
Section 26.5:
Implementing Rotations
Section 26.6:
Implementing the delete Method
Section 26.7:
The AVL Tree Class
Section 26.8:
Testing the AVL Tree Class
Section 26.9:
AVL Tree Time Complexity Analysis
Page 1028:
Programming Exercises
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
Section 27.8:
Implementing Set Using Hashing
Page 1058:
Programming Exercises
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 (DFS)
Section 28.8:
Case Study: The Connected Circles Problem
Section 28.9:
Breadth-First Search (BFS)
Section 28.10:
Case Study: The Nine Tails Problem
Page 1099:
Programming Exercises
Chapter 29: Weighted Graphs and ApplicationsSection 29.2:
Representing Weighted Graphs
Section 29.3:
The Weighted Graph Class
Section 29.4:
Minimum Spanning Trees
Section 29.5:
Finding Shortest Paths
Section 29.6:
Case Study: The Weighted Nine Tails Problem
Page 1138:
Programming Exercises
Chapter 30: Aggregate Operations for Collection StreamsSection 30.1:
Introduction
Section 30.2:
Stream Pipelines
Section 30.3:
IntStream, LongStream, and DoubleStream
Section 30.4:
Parallel Streams
Section 30.5:
Stream Reduction Using the reduce Method
Section 30.6:
Stream Reduction Using the collect Method
Section 30.7:
Grouping Elements Using the groupingby Collector
Section 30.8:
Case Studies
Page 1174:
Programming Exercises
Chapter 31: Advanced JAVAFX and FXMLPage 31-49:
Programming Exercises
Section 31.10:
TableView
Section 31.9:
TabPane
Section 31.8:
Split Pane
Section 31.7:
Context Menus
Section 31.6:
Menus
Section 31.5:
Strokes
Section 31.4:
Coordinate Transformations
Section 31.3:
Quadcurve, Cubic curve, and Path
Section 31.2:
JavaFX CSS
Chapter 32: Multithreading and Parallel ProgrammingPage 32-42:
Programming Exercises
Section 32.16:
Parallel Programming
Section 32.15:
Synchronized Collections
Section 32.14:
Thread States
Section 32.12:
Semaphores
Section 32.13:
Avoiding Deadlocks
Section 32.11:
Blocking Queues
Section 32.10:
Case Study: Producer/Consumer
Section 32.9:
Cooperation among Threads
Section 32.8:
Synchronization Using Locks
Section 32.7:
Thread Synchronization
Section 32.6:
Thread Pools
Section 32.5:
Animation Using Threads and the Platform. runLater Method
Section 32.4:
The Thread Class
Section 32.3:
Creating Tasks and Threads
Section 32.2:
Thread Concepts
Exercise 3
Exercise 4
Exercise 5
Exercise 6
Exercise 7
Exercise 8
Exercise 9
Exercise 10
Exercise 11
Exercise 12
Exercise 13
Exercise 14
Exercise 15
Exercise 16
Exercise 17
Exercise 18
Exercise 19
Exercise 20
Exercise 21
Exercise 22
Page 33-33:
Programming Exercises
Section 33.6:
Case Study: Distributed Tic-Tac-Toe Games
Section 33.5:
Sending and Receiving Objects
Section 33.4:
Serving Multiple Clients
Section 33.3:
The InetAddress Class
Section 33.2:
Client/Server Computing
Chapter 34: JAVA Database ProgrammingPage 34-39:
Programming Exercises
Section 34.7:
Retrieving Metadata
Section 34.6:
Quadcurve, Cubic Curve, and Path
Section 34.5:
PreparedStatement
Section 34.4:
JDBC
Section 34.3:
SQL
Section 34.2:
Relational Database Systems
Chapter 35: Advanced JAVA Database ProgrammingPage 35-26:
Programming Exercises
Section 35.6:
Storing and Retrieving Images in JDBC
Section 35.5:
RowSet, Jdbc RowSet, and CachedRowSet
Section 35.4:
Scrollable and Updatable Result Set
Section 35.3:
Batch Processing
Chapter 36: InternationalizationPage 36-32:
Programming Exercises
Section 36.6:
Character Encoding
Section 36.5:
Resource Bundles
Section 36.4:
Formatting Numbers
Section 36.3:
Displaying Date and Time
Section 36.2:
The Locale Class
Exercise 1
Exercise 3
Exercise 5
Exercise 6
Exercise 7
Exercise 8
Exercise 9
Exercise 10
Exercise 11
Page 37-46:
Programming ExercisesSection 37.8:
Session Tracking
Section 37.7:
Database Programming in Servlets
Section 37.4:
Ther Servlet API
Section 37.3:
Creating and Running Servlets
Section 37.2:
HTML and Common Gateway Interface
Chapter 38: JAVA Server PagesPage 38-34:
Programming ExercisesSection 38.1:
Forwarding Requests from JavaServer Pages
Section 38.7:
Using JavaBeans in jSP
Section 38.6:
jSP Directives
Section 38.5:
Predefined Variables
Section 38.4:
jSP Scripting Constructs
Section 38.2:
Creating a Simple jSP Page
Chapter 39: JAVA Server FacesPage 39-52:
Programming ExercisesSection 39.7:
Validating InputSection 39.6:
Session TrackingSection 39.4:
Processing the FormSection 39.3:
jSF GUI ComponentsSection 39.2:
Getting Started with jSF
Chapter 40: Remote Method InvocationCOMING SOON
Chapter 41: Web ServicesCOMING SOON
Chapter 42: 2 - 4 Trees and B - TreesCOMING SOON
Chapter 43: Red-Black TreesCOMING SOON
Chapter 44: Testing Using JUnitCOMING 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 Introduction to Java Programming and Data Structures, Comprehensive Version 11th Edition, you’ll learn how to solve your toughest homework problems. Our resource for Introduction to Java Programming and Data Structures, 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.
