Big Java Early Late Objects

Cover Title Page Copyright Preface Contents Chapter 1: Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar with YourProgramming Environment 1.5 Analyzing Your First Program 1.6 Errors 1.7 Problem Solving: Algorithm Design Chapter 2: Using Objects 2.1 Objects and Classes 2.2 Variables 2.3 Calling Methods 2.4 Constructing Objects 2.5 Accessor and Mutator Methods 2.6 The API Documentation 2.7 Implementing a Test Program 2.8 Object References 2.9 Graphical Applications 2.10 Ellipses, Lines, Text, and Color Chapter 3: Implementing Classes 3.1 Instance Variables and Encapsulation 3.2 Specifying the Public Interface of a Class 3.3 Providing the Class Implementation 3.4 Unit Testing 3.5 Problem Solving: Tracing Objects 3.6 Local Variables 3.7 The this Reference 3.8 Shape Classes Chapter 4: Fundamental Data Types 4.1 Numbers 4.2 Arithmetic 4.3 Input and Output 4.4 Problem Solving: First Do It By Hand 4.5 Strings Chapter 5: Decisions 5.1 The if Statement 5.2 Comparing Values 5.3 Multiple Alternatives 5.4 Nested Branches 5.5 Problem Solving: Flowcharts 5.6 Problem Solving: Selecting Test Cases 5.7 Boolean Variables and Operators 5.8 Application: Input Validation Chapter 6: Loops 6.1 The while Loop 6.2 Problem Solving: Hand-Tracing 6.3 The for Loop 6.4 The do Loop 6.5 Application: Processing Sentinel Values 6.6 Problem Solving: Storyboards 6.7 Common Loop Algorithms 6.8 Nested Loops 6.9 Application: Random Numbersand Simulations 6.10 Using a Debugger Chapter 7: Arrays and Array Lists 7.1 Arrays 7.2 The Enhanced for Loop 7.3 Common Array Algorithms 7.4 Problem Solving: Adapting Algorithms 7.5 Problem Solving: Discovering Algorithms byManipulating Physical Objects 7.6 Two-Dimensional Arrays 7.7 Array Lists 7.8 Regression Testing Chapter 8: Designing Classes 8.1 Discovering Classes 8.2 Designing Good Methods 8.3 Problem Solving: Patterns for Object Data 8.4 Static Variables and Methods 8.5 Packages 8.6 Unit Test Frameworks Chapter 9: Inheritance 9.1 Inheritance Hierarchies 9.2 Implementing Subclasses 9.3 Overriding Methods 9.4 Polymorphism 9.5 Object: The Cosmic Superclass Chapter 10: Interfaces 10.1 Using Interfaces for Algorithm Reuse 10.2 Working with Interface Variables 10.3 The Comparable Interface 10.4 Using Interfaces for Callbacks 10.5 Inner Classes 10.6 Mock Objects 10.7 Event Handling 10.8 Building Applications with Buttons 10.9 Processing Timer Events 10.10 Mouse Events Chapter 11: Input/Output and Exception Handling 11.1 Reading and Writing Text Files 11.2 Text Input and Output 11.3 Command Line Arguments 11.4 Exception Handling 11.5 Application: Handling Input Errors Chapter 12: Object-Oriented Design 12.1 Classes and Their Responsibilities 12.2 Relationships Between Classes 12.3 Application: Printing an Invoice Chapter 13: Recursion 13.1 Triangle Numbers 13.2 Recursive Helper Methods 13.3 The Efficiency of Recursion 13.4 Permutations 13.5 Mutual Recursion 13.6 Backtracking Chapter 14: Sorting and Searching 14.1 Selection Sort 14.2 Profiling the Selection Sort Algorithm 14.3 Analyzing the Performance of the Selection Sort Algorithm 14.4 Merge Sort 14.5 Analyzing the Merge Sort Algoithm 14.6 Searching 14.7 Problem Solving: Estimating the Running Time of an Algorithm 14.8 Sorting and Searching in the Java Library Chapter 15: The Java Collections Framework 15.1 An Overview of the Collections Framework 15.2 Linked Lists 15.3 Sets 15.4 Maps 15.5 Stacks, Queues, and Priority Queues 15.6 Stack and Queue Applications Chapter 16: Basic Data Structures 16.1 Implementing Linked Lists 16.2 Implementing Array Lists 16.3 Implementing Stacks and Queues 16.4 Implementing a Hash Table Chapter 17: Tree Structures 17.1 Basic Tree Concepts 17.2 Binary Trees 17.3 Binary Search Trees 17.4 Tree Traversal 17.5 Red-Black Trees 17.6 Heaps 17.7 The Heapsort Algorithm Chapter 18: Generic Classes 18.1 Generic Classes and Type Parameters 18.2 Implementing Generic Types 18.3 Generic Methods 18.4 Constraining Type Parameters 18.5 Type Erasure Chapter 19: Graphical User Interfaces 19.1 Layout Management 19.2 Processing Text Input 19.3 Choices 19.4 Menus 19.5 Exploring the Swing Documentation Chapter 20: Streams and Binary Input/Output 20.1 Readers, Writers, and Streams 20.2 Binary Input and Output 20.3 Random Access 20.4 Object Streams Appendix A: The Basic Latin and Latin-1 Subsets of Unicode Appendix B: Java Operator Summary Appendix C: Java Reserved Word Summary Appendix D: The Java Library Appendix E: Java Syntax Summary Appendix F: Tool Summary Appendix G: Number Systems Appendix H: UML Summary Appendix I: Java Language Coding Guidelines Appendix J: HTML Summary Glossary Index Credits Copyright Title Page Dedication Contents Chapter 1: ‘I’m thinking’ – Oh, but are you? Chapter 2: Renegade perception Chapter 3: The Pushbacker sting Chapter 4: ‘Covid’: The calculated catastrophe Chapter 5: There is no ‘virus’ Chapter 6: Sequence of deceit Chapter 7: War on your mind Chapter 8: ‘Reframing’ insanity Chapter 9: We must have it? So what is it? Chapter 10: Human 2.0 Chapter 11: Who controls the Cult? Chapter 12: Escaping Wetiko Postscript Appendix: Cowan-Kaufman-Morell Statement on Virus Isolation Bibliography Index Cover Title Page Copyright Preface Acknowledgments CONTENTS Special Features Chapter 1 Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar with Your Programming Environment 1.5 Analyzing Your First Program 1.6 Errors 1.7 Problem Solving: Algorithm Design Chapter 2 Fundamental Data Types 2.1 Variables 2.2 Arithmetic 2.3 Input and Output 2.4 Problem Solving: First Do It By Hand 2.5 Strings Chapter 3 Decisions 3.1 The if Statement 3.2 Comparing Numbers and Strings 3.3 Multiple Alternatives 3.4 Nested Branches 3.5 Problem Solving: Flowcharts 3.6 Problem Solving: Test Cases 3.7 Boolean Variables and Operators 3.8 Application: Input Validation Chapter 4 Loops 4.1 The while Loop 4.2 Problem Solving: Hand-Tracing 4.3 The for Loop 4.4 The do Loop 4.5 Application: Processing Sentinel Values 4.6 Problem Solving: Storyboards 4.7 Common Loop Algorithms 4.8 Nested Loops 4.9 Application: Random Numbersand Simulations Chapter 5 Methods 5.1 Methods as Black Boxes 5.2 Implementing Methods 5.3 Parameter Passing 5.4 Return Values 5.5 Methods Without Return Values 5.6 Problem Solving: Reusable Methods 5.7 Problem Solving: Stepwise Refinement 5.8 Variable Scope 5.9 Recursive Methods (Optional) Chapter 6 Arrays and Array Lists 6.1 Arrays 6.2 The Enhanced for Loop 6.3 Common Array Algorithms 6.4 Using Arrays with Methods 6.5 Problem Solving: Adapting Algorithms 6.6 Problem Solving: Discovering Algorithms by Manipulating Physical Objects 6.7 Two-Dimensional Arrays 6.8 Array Lists Chapter 7 Input/Output and Exception Handling 7.1 Reading and Writing Text Files 7.2 Text Input and Output 7.3 Command Line Arguments 7.4 Exception Handling 7.5 Application: Handling Input Errors Chapter 8 Objects and Classes 8.1 Object-Oriented Programming 8.2 Implementing a Simple Class 8.3 Specifying the Public Interface of a Class 8.4 Designing the Data Representation 8.5 Implementing Instance Methods 8.6 Constructors 8.7 Testing a Class 8.8 Problem Solving: Tracing Objects 8.9 Problem Solving: Patterns for Object Data 8.10 Object References 8.11 Static Variables and Methods Chapter 9 Inheritance and Interfaces 9.1 Inheritance Hierarchies 9.2 Implementing Subclasses 9.3 Overriding Methods 9.4 Polymorphism 9.5 Object: The Cosmic Superclass 9.6 Interface Types Chapter 10 Graphical User Interfaces 10.1 Frame Windows 10.2 Events and Event Handling 10.3 Processing Text Input 10.4 Creating Drawings Chapter 11 Advanced User Interfaces 11.1 Layout Management 11.2 Choices 11.3 Menus 11.4 Exploring the Swing Documentation 11.5 Using Timer Events for Animations 11.6 Mouse Events Chapter 12 Object-Oriented Design 12.1 Classes and Their Responsibilities 12.2 Relationships Between Classes 12.3 Application: Printing an Invoice 12.4 Packages Chapter 13 Recursion 13.1 Triangle Numbers Revisited 13.2 Problem Solving: Thinking Recursively 13.3 Recursive Helper Methods 13.4 The Efficiency of Recursion 13.5 Permutations 13.6 Mutual Recursion 13.7 Backtracking Chapter 14 Sorting and Searching 14.1 Selection Sort 14.2 Profiling the Selection Sort Algorithm 14.3 Analyzing the Performance of the Selection Sort Algorithm 14.4 Merge Sort 14.5 Analyzing the Merge Sort Algorithm 14.6 Searching 14.7 Problem Solving: Estimating the Running Time of an Algorithm 14.8 Sorting and Searching in the Java Library Chapter 15 The Java Collections Framework 15.1 An Overview of the Collections Framework 15.2 Linked Lists 15.3 Sets 15.4 Maps 15.5 Stacks, Queues, and Priority Queues 15.6 Stack and Queue Applications Chapter 16 Basic Data Structures 16.1 Implementing Linked Lists 16.2 Implementing Array Lists 16.3 Implementing Stacks and Queues 16.4 Implementing a Hash Table Chapter 17 Tree Structures 17.1 Basic Tree Concepts 17.2 Binary Trees 17.3 Binary Search Trees 17.4 Tree Traversal 17.5 Red-Black Trees 17.6 Heaps 17.7 The Heapsort Algorithm Chapter 18 Generic Classes 18.1 Generic Classes and Type Parameters 18.2 Implementing Generic Types 18.3 Generic Methods 18.4 Constraining Type Parameters 18.5 Type Erasure Chapter 19 Streams and Binary Input/Output 19.1 Readers, Writers, and Streams 19.2 Binary Input and Output 19.3 Random Access 19.4 Object Streams Chapter 20 Multithreading 20.1 Running Threads 20.2 Terminating Threads 20.3 Race Conditions 20.4 Synchronizing Object Access 20.5 Avoiding Deadlocks 20.6 Application: Algorithm Animation Chapter 21 Internet Networking 21.1 The Internet Protocol 21.2 Application Level Protocols 21.3 A Client Program 21.4 A Server Program 21.5 URL Connections Chapter 22 Relational Databases 22.1 Organizing Database Information 22.2 Queries 22.3 Installing a Database 22.4 Database Programming in Java 22.5 Application: Entering an Invoice Chapter 23 XML 23.1 XML Tags and Documents 23.2 Parsing XML Documents 23.3 Creating XML Documents 23.4 Validating XML Documents Chapter 24 Web Applications 24.1 The Architecture of a Web Application 24.2 The Architecture of a JSF Application 24.3 JavaBeans Components 24.4 Navigation Between Pages 24.5 JSF Components 24.6 A Three-Tier Application Appendices Appendix A The Basic Latin and Latin-1 Subsets of Unicode Appendix B Java Operator Summary Appendix C Java Reserved Word Summary Appendix D The Java Library Appendix E Java Syntax Summary Appendix F HTML Summary Appendix G Tool Summary Appendix H javadoc Summary Appendix I Number Systems Appendix J Bit and Shift Operations Appendix K UML Summary Appendix L Java Language Coding Guidelines Glossary Index Illustration Credits This book is primarily a practical reference book for professional XSLT developers. It assumes no previous knowledge of the language, and many developers have used it as their first introduction to XSLT; however, it is not structured as a tutorial, and there are other books on XSLT that provide a gentler approach for beginners. The book does assume a basic knowledge of XML, HTML, and the architecture of the Web, and it is written for experienced programmers. There@2019s no assumption that you know any particular language such as Java or Visual Basic, just that you recognize the concepts that all programming languages have in common. The book is suitable both for XSLT 1.0 users upgrading to XSLT 2.0, and for newcomers to XSLT. The book is also equally suitable whether you work in the Java or .NET world. As befits a reference book, a key aim is that the coverage should be comprehensive and authoritative. It is designed to give you all the details, not just an overview of the 20 percent of the language that most people use 80 percent of the time. It@2019s designed so that you will keep coming back to the book whenever you encounter new and challenging programming tasks, not as a book that you skim quickly and then leave on the shelf. If you like detail, you will enjoy this book; if not, you probably won@2019t. But as well as giving the detail, this book aims to explain the concepts, in some depth. It@2019s therefore a book for people who not only want to use the language but who also want to understand it at a deep level. The book aims to tell you everything you need to know about the XSLT 2.0 language. It gives equal weight to the things that are new in XSLT 2.0 and the things that were already present in version 1.0. The book is about the language, not about specific products However, there are appendices about Saxon (the author@2019s own implementation of XSLT 2.0), about the Altova XSLT 2.0 implementation, and about the Java and Microsoft APIs for controlling XSLT transformations, which will no doubt be upgraded to handle XSLT 2.0 as well as 1.0. A third XSLT 2.0 processor, Gestalt, was released shortly before the book went to press, too late to describe it in any detail. But the experience of XSLT 1.0 is that there has been a very high level of interoperability between different XSLT processors, and if you can use one of them, then you can use them all. In the previous edition we split XSLT 2.0 and XPath 2.0 into separate volumes. The idea was that some readers might be interested in XPath alone. However, many bought the XSLT 2.0 book without its XPath companion and were left confused as a result; so this time, the material is back together. The XPath reference information is in self-contained chapters, so it should still be accessible when you use XPath in contexts other than XSLT. The book does not cover XSL Formatting Objects, a big subject in its own right. Nor does it cover XML Schemas in any detail. If you want to use these important technologies in conjunction with XSLT, there are other books that do them justice This book introduces programmers to objects at a gradual pace. Optional example modules are included using Alice and Greenfoot. The examples feature annotations with dos and don'ts along with cross references to more detailed explanations in the text. New tables show a large number of typical and cautionary examples. New programming and review problems are also presented that ensure a broad coverage of topics. Cay will also add sections on problem solving, and a new, more approachable and visual design developed for JfE and BJLO is used. Cay Horstmann's fifth edition of Big Java, Early Objects provides a comprehensive and approachable introduction to fundamental programming techniques and design skills, helping students master basic concepts. The inclusion of advanced chapters makes the text suitable for a 2-semester course sequence, or as a comprehensive reference to programming in Java. The fifth edition includes new exercises from science and business which engages students with real world applications of Java in different industries -- BACK COVER