Chapter 1. INTRODUCTION

• What Is a Computer?
• What Is Programming?
• The Anatomy of a Computer
• Translating Human-Readable Programs to Machine Code
• Programming Languages
• Programming Language Design and Evolution
• Becoming Familiar with Your Computer
• Compiling a Simple Program
• Errors
• The Compilation Process
• Algorithms

• Number Types
• Input and Output
• Assignment
• Constants
• Arithmetic
• Strings

• Constructing Objects
• Using Objects
• Real-Life Objects
• Displaying Graphical Shapes
• Graphics Structures
• Choosing a Coordinate System
• Getting Input from the Graphics Window
• Copying Objects
• Comparing Visual and Numerical Information

• The if Statement
• Relational Operations
• Input Validation
• The if/else Statement
• Multiple Alternatives
• Nested Branches
• Logical Operations
• De Morgan's Law
• Using Boolean Variables

• Functions as Black Boxes
• Writing Functions
• Function Comments
• Return Values
• Parameters
• Side Effects
• Procedures
• Procedures That Modify Their Parameters
• Variable Scope
• Stepwise Refinement
• From Pseudocode to Code
• Walkthroughs
• Preconditions
• Recursion

• Simple Loops
• Other Loop Statements
• Common Loop Types
• Simulations
• Nested Loops
• Block Scope

• Unit Tests
• Selecting Test Cases
• Test Case Evaluation
• Asserting Preconditions
• Program Traces
• The Debugger
• Strategies
• Debugger Limitations

• Discovering Classes
• Interfaces
• Encapsulation
• Methods
• Default Constructors
• Constructors with Parameters
• Accessing Data Fields
• Comparing Instance Methods with Class Methods
• Object-Oriented Design

• Using Arrays to Collect Data Items
• Array Subscripts
• Array Parameters and Return Values
• Simple Array Algorithms
• Parallel Arrays
• Arrays as Object Data
• Matrices

• Reading and Writing Text Files
• Example: Reading Input Data in a Graphics Program
• Command Line Arguments
• Random Access

• Source and Class Files
• Organizing Related Classes into Packages
• How Classes are Located
• Access Control
• Static Variables and Constants
• An Example Package

• Selection Sort
• Profiling the Selection Sort Algorithm
• Analyzing the Performance of the Selection Sort Algorithm
• Merge Sort
• Analyzing the Merge Sort Algorithm
• Searching
• Binary Search
• Searching and Sorting Real Data
• The Efficiency of Recursion

• Array-Based Linked Lists
• Linked Lists without Arrays
• List Element Access with a Cursor
• Binary Search Trees

• Inheritance
• Calling the Base-Class Constructor
• Calling Base-Class Member Functions
• Polymorphism
• Virtual Functions
• Class Relationships

• Introduction
• Source Files
• Classes
• Functions and Methods
• Variables and Constants
• Control Flow
• Lexical Issues

• Types
• Variables
• Expressions
• Classes
• Methods
• Constructors
• Statements
• Mathematical Functions
• Strings
• Arrays, Vectors and Matrices
• Input and Output
• Graphics
• Time
• Employee Records
• Life without the ccj Package
• Data Types and Variables
• Variables and Constants
• Classes
• Objects
• Functions
• Vectors
• Input and Output
• Pointers
• Inheritance