Enhanced descriptions from Syndetics:

An introductory text for beginners with no background in programming, this book teaches students how to write object-oriented programs and is appropriate for any first programming course in Java. It covers both Java applets and applications.

Table of contents provided by Syndetics

• Preface (p. xiii)
• New Features in the Second Edition (p. xiv)
• Major Features (p. xv)
• Supplement Materials (p. xxiv)
• Book Organization (p. xxv)
• Acknowledgments (p. xxvii)
• 0 Introduction to Computers and Programming Languages (p. 1)
• 0.1 A History of Computers (p. 2)
• 0.2 Computer Architecture (p. 5)
• 0.3 Programming Languages (p. 11)
• 0.4 Java (p. 13)
• 0.5 Exercises (p. 14)
• 1 Introduction to Object-Oriented Programming and Software Development (p. 15)
• 1.1 Classes and Objects (p. 16)
• 1.2 Messages and Methods (p. 18)
• 1.3 Class and Instance Data Values (p. 23)
• 1.4 Inheritance (p. 26)
• 1.5 Software Engineering and Software Life Cycle (p. 29)
• 1.6 Having Fun with Java (p. 31)
• 1.7 Exercises (p. 34)
• 2 Java Programming Basics (p. 37)
• 2.1 The First Java Application (p. 38)
• 2.2 Program Components (p. 48)
• 2.3 Edit--Compile--Run Cycle (p. 59)
• 2.4 The javabook Package (p. 61)
• 2.5 Sample Program: Displaying Messages (p. 62)
• 2.6 The First Java Applet (p. 66)
• 2.7 Exercises (p. 77)
• 3 Numerical Data (p. 83)
• 3.1 Variables (p. 84)
• 3.2 Arithmetic Expressions (p. 92)
• 3.3 Constants (p. 98)
• 3.4 The Math Class (p. 100)
• 3.5 InputBox (p. 103)
• 3.6 OutputBox (p. 106)
• 3.7 Sample Program: Loan Calculator (p. 113)
• 3.8 Numerical Representation (Optional) (p. 124)
• 3.9 Exercises (p. 128)
• 4 Defining Instantiable Classes (p. 139)
• 4.1 Defining Instantiable Classes (p. 140)
• 4.2 Instantiable Classes and Constructors (p. 152)
• 4.3 Visibility Modifiers: public and private (p. 157)
• 4.4 Local Variables, Return Values, and Parameter Passing (p. 162)
• 4.5 Loan Calculator Program with an Instantiable Class (p. 167)
• 4.6 Exercises (p. 181)
• 5 Processing Input with Applets (p. 191)
• 5.1 Placing GUI Objects on Applets (p. 192)
• 5.2 Adding ActionListener to an Event Source (p. 199)
• 5.3 Absolute Positioning of GUI Objects (p. 206)
• 5.4 The Button Class (p. 208)
• 5.5 Converting Text to a Numerical Value (p. 210)
• 5.6 Sample Program: Finding Body Mass Index (BMI) (p. 213)
• 5.7 Running an Applet as an Application (p. 223)
• 5.8 Exercises (p. 224)
• 6 Selection Statements (p. 229)
• 6.1 The if Statement (p. 230)
• 6.2 Boolean Expressions and Variables (p. 238)
• 6.3 Nested-if Statements (p. 242)
• 6.4 ListBox (p. 249)
• 6.5 The switch Statement (p. 252)
• 6.6 Sample Program: Drawing Shapes (p. 258)
• 6.7 Exercises (p. 280)
• 7 Repetition Statements (p. 289)
• 7.1 The while Statement (p. 290)
• 7.2 Pitfalls in Writing Repetition Statements (p. 294)
• 7.3 The do--while Statement (p. 299)
• 7.4 ResponseBox (p. 303)
• 7.5 The for Statement (p. 308)
• 7.6 Nested-for Statements (p. 312)
• 7.7 The Format Class (p. 316)
• 7.8 Loan Tables (p. 322)
• 7.9 Sample Program: Hi-Lo Game (p. 325)
• 7.10 Recursive Methods (Optional) (p. 338)
• 7.11 Exercises (p. 343)
• 8 Characters and Strings (p. 355)
• 8.1 Characters (p. 356)
• 8.2 Strings (p. 359)
• 8.3 Primitive versus Reference Types (p. 370)
• 8.4 StringBuffer (p. 379)
• 8.5 Passing Objects as Parameters (p. 384)
• 8.6 Returning an Object from Methods (p. 389)
• 8.7 Sample Program: Word Play (p. 392)
• 8.8 Exercises (p. 404)
• 9 Arrays (p. 411)
• 9.1 Array Basics (p. 412)
• 9.2 Arrays of Objects (p. 421)
• 9.3 Passing Arrays to Methods (p. 431)
• 9.4 MultilnputBox (p. 436)
• 9.5 Self-Referencing Pointer (p. 439)
• 9.6 Sample Development: The Address Book (p. 446)
• 9.7 Two-Dimensional Arrays (p. 463)
• 9.8 Vectors (p. 470)
• 9.9 Exercises (p. 476)
• 10 Sorting and Searching (p. 481)
• 10.1 Searching (p. 482)
• 10.2 Sorting (p. 488)
• 10.3 Heapsort (p. 495)
• 10.4 Sample Program: Sorting an AddressBook (p. 509)
• 10.5 Exercises (p. 515)
• 11 File Input and Output (p. 519)
• 11.1 File and FileDialog Objects (p. 520)
• 11.2 Low-Level File I/O (p. 525)
• 11.3 High-Level File I/O (p. 532)
• 11.4 Handling Exceptions (p. 539)
• 11.5 Object I/O (p. 544)
• 11.6 Sample Class: Saving an AddressBook Object (p. 548)
• 11.7 Exercises (p. 556)
• 12 Reusable Classes and Packages (p. 559)
• 12.1 Object Categories (p. 560)
• 12.2 Method Overriding and Overloaded Methods (p. 562)
• 12.3 Sample Classes: Reusable EggyPeggy and HiLo (p. 569)
• 12.4 Package Organization (p. 595)
• 12.5 Exercises (p. 597)
• 13 GUI Objects and Event-Driven Programming (p. 603)
• 13.1 Placing Buttons on a Frame (p. 605)
• 13.2 Handling Events (p. 611)
• 13.3 Placing TextField Objects on a Frame (p. 618)
• 13.4 Menus (p. 620)
• 13.5 Handling Mouse Events (p. 626)
• 13.6 Other GUI Objects (p. 634)
• 13.7 Sample Program: A Simple Calculator (p. 639)
• 13.8 Exercises (p. 652)
• 14 Inheritance and Polymorphism (p. 657)
• 14.1 Defining Classes with Inheritance (p. 658)
• 14.2 Using Classes Effectively with Polymorphism (p. 662)
• 14.3 Inheritance and Member Accessibility (p. 666)
• 14.4 Inheritance and Constructors (p. 672)
• 14.5 Abstract Superclasses and Abstract Methods (p. 676)
• 14.6 When and When Not to Use Inheritance (p. 682)
• 14.7 Sample Program: Computing Course Grades (p. 684)
• 14.8 Exercises (p. 704)
• 15 Class Roster Maintenance Program (p. 709)
• 15.1 Method Call Sequence Diagram (p. 710)
• 15.2 Problem Statement (p. 711)
• 15.3 Overall Planning (p. 712)
• 15.4 Step 1 Development: Program Shell with Menus (p. 716)
• 15.5 Step 2 Development: Create a New Roster (p. 722)
• 15.6 Step 3 Development: Add Students (p. 729)
• 15.7 Step 4 Development: Delete Students (p. 737)
• 15.8 Step 5 Development: Edit Student Names (p. 740)
• 15.9 Step 6 Development: Edit Test Scores and Compute Grades (p. 746)
• 15.10 Step 7 Development: Display Student Information (p. 753)
• 15.11 Step 8 Development: Storing Grade Rosters (p. 765)
• 15.12 Step 9 Development: Finalize and Improve (p. 775)
• 15.13 The StudentNameDialog Class (p. 776)
• 15.14 The TestScoreDialog Class (p. 786)
• 15.15 Exercises (p. 791)
• 16 Recursive Algorithms (p. 797)
• 16.1 Basic Elements of Recursion (p. 798)
• 16.2 Directory Listing (p. 799)
• 16.3 Anagram (p. 801)
• 16.4 Towers of Hanoi (p. 805)
• 16.5 Quicksort (p. 809)
• 16.6 When Not to Use Recursion (p. 815)
• 16.7 Exercises (p. 817)
• A The javabook Package (p. 819)