A Comprehensive Introduction to Object-oriented Programming with Java

Description

"A Comprehensive Introduction to Object-Oriented Programming with Java" provides an accessible and technically thorough introduction to the basics of programming using java. The text takes a truly object-oriented approach. Objects are used early so that students think in objects right from the beginning. The text focuses on showing students a consistent problem solving approach. Tittle Contents 0 Introduction to Computers and Programming Languages 0.1 A History of Computers 0.2 Computer Architecture 0.3 Programming Languages 0.4 Java 1 Introduction to Object-Oriented Programming and Software Development 1.1 Classes and Objects 1.2 Messages and Methods 1.3 Class and Instance Data Values 1.4 Inheritance 1.5 Software Engineering and Software Life Cycle 2 Getting Started with Java 2.1 The First Java Program 2.2 Program Components 2.3 Edit-Compile-Run Cycle 2.4 Sample Java Standard Classes 2.5 Sample Development 3 Numerical Data 3.1 Variables 3.2 Arithmetic Expressions 3.3 Constants 3.4 Displaying Numerical Values 3.5 Getting Numerical Input 3.6 The Math Class 3.7 Random Number Generation 3.8 The GregorianCalendar Class 3.9 Sample Development 3.10 Numerical Representation (Optional) 4 Defining Your Own Classes—Part 1 4.1 First Example:Defining and Using a Class 4.2 Second Example:Defining and Using Multiple Classes 4.3 Matching Arguments and Parameters 4.4 Passing Objects to a Method 4.5 Constructors 4.6 Information Hiding and Visibility Modifiers 4.7 Class Constants 4.8 Local Variables 4.9 Calling Methods of the Same Class 4.10 Changing Any Class to a Main Class 4.11 Sample Development 5 Selection Statements 5.1 The if Statement 5.2 Nested if Statements 5.3 Boolean Expressions and Variables 5.4 Comparing Objects 5.5 The switch Statement 5.6 Drawing Graphics 5.7 Enumerated Constants 5.8 Sample Development 6 Repetition Statements 6.1 The while Statement 6.2 Pitfalls in Writing Repetition Statements 6.3 The do–while Statement 6.4 Loop-and-a-Half Repetition Control 6.5 The for Statement 6.6 Nested for Statements 6.7 Formatting Output 6.8 Loan Tables 6.9 Estimating the Execution Time 6.10 Recursive Methods (Optional) 6.11 Sample Development 7 Defining Your Own Classes—Part 2 7.1 Returning an Object from a Method 7.2 The Reserved Word this 7.3 Overloaded Methods and Constructors 7.4 Class Variables and Methods 7.5 Call-by-Value Parameter Passing 7.6 Organizing Classes into a Package 7.7 Using Javadoc Comments for Class Documentation 7.8 The Complete Fraction Class 7.9 Sample Development 8 Exceptions and Assertions 8.1 Catching Exceptions 8.2 Throwing Exceptions and Multiple catch Blocks 8.3 Propagating Exceptions 8.4 Types of Exceptions 8.5 Programmer-Defined Exceptions 8.6 Assertions 8.7 Sample Development 9 Characters and Strings 9.1 Characters 9.2 Strings 9.3 Pattern Matching and Regular Expression 9.4 The Pattern and Matcher Classes 9.5 Comparing Strings 9.6 StringBuffer and StringBuilder 9.7 Sample Development 10 Arrays and Collections 10.1 Array Basics 10.2 Arrays of Objects 10.3 The For-Each Loop 10.4 Passing Arrays to Methods 10.5 Two-Dimensional Arrays 10.6 Lists and Maps 10.7 Sample Development 11 Sorting and Searching 11.1 Searching 11.2 Sorting 11.3 Heapsort 11.4 Sample Development 12 File Input and Output 12.1 File and JFileChooser Objects 12.2 Low-Level File I/O 12.3 High-Level File I/O 12.4 Object I/O 12.5 Sample Development 13 Inheritance and Polymorphism 13.1 A Simple Example 13.2 Defining Classes with Inheritance 13.3 Using Classes Effectively with Polymorphism 13.4 Inheritance and Member Accessibility 13.5 Inheritance and Constructors 13.6 Abstract Superclasses and Abstract Methods 13.7 Inheritance versus Interface 13.8 Sample Development 14 GUI and Event-Driven Programming 14.1 Simple GUI I/O with JOptionPane 14.2 Customizing Frame Windows 14.3 GUI Programming Basics 14.4 Text-Related GUI Components 14.5 Layout Managers 14.6 Effective Use of Nested Panels 14.7 Other GUI Components 14.8 Menus 14.9 Handling Mouse Events 15 Recursive Algorithms 15.1 Basic Elements of Recursion 15.2 Directory Listing 15.3 Anagram 15.4 Towers of Hanoi 15.5 Quicksort 15.6 When Not to Use Recursion 16 Memory Allocation Schemes and Linked Data Structures 16.1 Contiguous Memory Allocation Scheme 16.2 Noncontiguous Memory Allocation Scheme 16.3 Manipulating Linked Lists 16.4 Linked Lists of Objects 16.5 Sample Development 17 Generics and Type Safety 17.1 Generic Classes 17.2 Generics and Collections 17.3 Generics, Inheritance, and Java Interface 17.4 Additional Topics and Pitfalls 18 List ADT 18.1 The List ADT 18.2 The List Interface 18.3 The Array Implementation of the List ADT 18.4 The Linked-List Implementation of the List ADT 18.5 The Linked Implementation with the Head Node 18.6 The Iterator Design Pattern 18.7 Sample Development 19 Stack ADT 19.1 The Stack ADT 19.2 The Stack Interface 19.3 The Array Implementation 19.4 The Linked-List Implementation 19.5 Implementation Using NPSList 19.6 Sample Applications:Matching HTML Tags 19.7 Sample Applications: Solving a Maze with Backtracking 20 Queue ADT 20.1 The Queue ADT 20.2 The Queue Interface 20.3 The Array Implementation 20.4 The Linked-List Implementation 20.5 Implementation Using NPSList 20.6 Priority Queue Appendix A Appendix B Appendix C Appendix D Index