부산대학교 도서관

국외eBook

Big Java : Late Objects.

1st ed.

1 online resource (1236 pages)

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 Numbers and 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 Performanceof 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.

Big Java: Late Objects is a comprehensive introduction to Java and computer programming, which focuses on the principles of programming, software engineering, and effective learning. It is designed for a two-semester first course in programming for computer science students.

Print version : Horstmann, Cay S. Big Java : Late Objects New York : Wiley,c2012 9781118087886

9781118214572