Big Java : Late Objects / Cay Horstmann.

Contributor(s):

Horstmann, Cay S, 1959-

Material type: Text

TextPublication details: Hoboken, NJ : John Wiley & Sons, 2013.Description: xxxiii, 1018 s. : col. ill. ; 26 cmISBN:

9781118087886 (paperback)
1118087887 (paperback)

Subject(s):

Java (Computer program language)

Holdings
Item type	Current library	Call number	Status	Barcode
Standard Loan	Thurles Library Main Collection	005.276 HOR (Browse shelf(Opens below))	Available	30026000066091
Standard Loan	Thurles Library Main Collection	005.276 HOR (Browse shelf(Opens below))	Available	30026000066109
Standard Loan	Thurles Library Main Collection	005.276 HOR (Browse shelf(Opens below))	Available	30026000066935
Standard Loan	Thurles Library Main Collection	005.276 HOR (Browse shelf(Opens below))	Available	30026000066943

Enhanced descriptions from Syndetics:

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. Using an innovative visual design that leads readers step-by-step through intricacies of Java programming, Big Java: Late Objects instills confidence in beginning programmers and confidence leads to success.

Includes index.

Table of contents provided by Syndetics

Preface (p. v)
Special Features (p. xxvi)
Chapter 1 Introduction (p. 1)
1.1 Computer Programs (p. 2)
1.2 The Anatomy of a Computer (p. 3)
1.3 The Java Programming Language (p. 5)
1.4 Becoming Familiar with Your Programming Environment (p. 8)
1.5 Analyzing Your First Program (p. 12)
1.6 Errors (p. 15)
1.7 Problem Solving: Algorithm Design (p. 16)
Chapter 2 Fundamental Data Types (p. 29)
2.1 Variables (p. 30)
2.2 Arithmetic (p. 41)
2.3 Input and Output (p. 48)
2.4 Problem Solving: First Do It By Hand (p. 57)
2.5 Strings (p. 59)
Chapter 3 Decisions (p. 81)
3.1 The if Statement (p. 82)
3.2 Comparing Numbers and Strings (p. 88)
3.3 Multiple Alternatives (p. 96)
3.4 Nested Branches (p. 100)
3.5 Problem Solving: Flowcharts (p. 105)
3.6 Problem Solving: Test Cases (p. 108)
3.7 Boolean Variables and Operators (p. 111)
3.8 Application: Input Validation (p. 116)
Chapter 4 Loops (p. 139)
4.1 The while Loop (p. 140)
4.2 Problem Solving: Hand-Tracing (p. 147)
4.3 The for Loop (p. 150)
4.4 The do Loop (p. 156)
4.5 Application: Processing Sentinel Values (p. 158)
4.6 Problem Solving: Storyboards (p. 162)
4.7 Common Loop algorithms (p. 165)
4.8 Nested Loops (p. 172)
4.9 Application: Random Numbers and Simulations (p. 176)
Chapter 5 Methods (p. 201)
5.1 Methods as Black Boxes (p. 202)
5.2 Implementing Methods (p. 204)
5.3 Parameter Passing (p. 207)
5.4 Return Values (p. 210)
5.5 Methods Without Return Values (p. 214)
5.6 Problem Solving: Reusable Methods (p. 215)
5.7 Problem Solving: Stepwise Refinement (p. 218)
5.8 Variable Scope (p. 225)
5.9 Recursive Methods (Optional) (p. 228)
Chapter 6 Arrays And Array Lists (p. 249)
6.1 Arrays (p. 250)
6.2 The Enhanced for Loop (p. 257)
6.3 Common Array Algorithms (p. 258)
6.4 Using Arrays with Methods (p. 268)
6.5 Problem Solving: Adapting Algorithms (p. 272)
6.6 Problem Solving: Discovering Algorithms by Manipulating Physical Objects (p. 279)
6.7 Two-Dimensional Arrays (p. 282)
6.8 Array Lists (p. 289)
Chapter 7 Input/Output And Exception Handling (p. 317)
7.1 Reading and Writing Text files (p. 318)
7.2 Text Input and Output (p. 323)
7.3 Command Line Arguments (p. 330)
7.4 Exception Handling (p. 337)
7.5 Application: Handling Input Errors (p. 347)
Chapter 8 Objects And Classes (p. 361)
8.1 Object-Oriented Programming (p. 362)
8.2 Implementing a Simple Class (p. 364)
8.3 Specifying the Public Interface of a Class (p. 367)
8.4 Designing the Data representation (p. 371)
8.5 Implementing Instance Methods (p. 372)
8.6 Constructors (p. 375)
8.7 Testing a Class (p. 380)
8.8 Problem Solving: Tracing Objects (p. 386)
8.9 Problem Solving: Patterns for Object Data (p. 388)
8.10 Object References (p. 395)
8.11 Static Variables and Methods (p. 400)
Chapter 9 Inheritance And Interfaces (p. 415)
9.1 Inheritance Hierarchies (p. 416)
9.2 Implementing Subclasses (p. 420)
9.3 Overriding Methods (p. 424)
9.4 Polymorphism (p. 430)
9.5 Object: The Cosmic Superclass (p. 441)
9.6 Interface Types (p. 448)
Chapter 10 Graphical User Interfaces (p. 465)
10.1 Frame Windows (p. 466)
10.2 Events and Event Handling (p. 470)
10.3 Processing Text Input (p. 481)
10.4 Creating Drawings (p. 487)
Chapter 11 Advanced User Interfaces (p. 507)
11.1 Layout Management (p. 508)
11.2 Choices (p. 510)
11.3 Menus (p. 521)
11.4 Exploring the Swing Documentation (p. 528)
11.5 Using Timer events for Animations (p. 533)
11.6 Mouse Events (p. 536)
Chapter 12 Object-Oriented Design (p. 549)
12.1 Classes and Their Responsibilities (p. 550)
12.2 Relationships Between Classes (p. 554)
12.3 Application: Printing an Invoice (p. 562)
12.4 Packages (p. 574)
Chapter 13 Recursion (p. 585)
13.1 Triangle Numbers Revisited (p. 586)
13.2 Problem Solving: Thinking Recursively (p. 590)
13.3 Recursive Helper Methods (p. 594)
13.4 The Efficiency of Recursion (p. 596)
13.5 Permutations (p. 601)
13.6 Mutual Recursion (p. 606)
13.7 Backtracking (p. 612)
Chapter 14 Sorting And Searching (p. 627)
14.1 Selection Sort (p. 628)
14.2 Profiling the Selection Sort Algorithm (p. 631)
14.3 Analyzing the Performance of the Selection Sort Algorithm (p. 634)
14.4 Merge Sort (p. 639)
14.5 Analyzing the Merge Sort Algorithm (p. 642)
14.6 Searching (p. 646)
14.7 Problem Solving: Estimating the Running Time of an Algorithm (p. 651)
14.8 Sorting and Searching in the Java Library (p. 656)
Chapter 15 The Java Collections Framework (p. 669)
15.1 An Overview of the Collections Framework (p. 670)
15.2 Linked Lists (p. 672)
15.3 Sets (p. 679)
15.4 Maps (p. 684)
15.5 Stacks, Queues, and Priority Queues (p. 690)
15.6 Stack and Queue Applications (p. 693)
Chapter 16 Basic Data Structures (p. 713)
16.1 Implementing Linked Lists (p. 714)
16.2 Implementing Array Lists (p. 728)
16.3 Implementing Stacks and Queues (p. 733)
16.4 Implementing a Hash Table (p. 739)
Chapter 17 Tree Structures (p. 759)
17.1 Basic Tree Concepts (p. 760)
17.2 Binary Trees (p. 764)
17.3 Binary Search Trees (p. 769)
17.4 Tree Traversal (p. 778)
17.5 Red-Black Trees (p. 784)
17.6 Heaps (p. 791)
17.7 The Heapsort Algorithm (p. 802)
Chapter 18 Generic Classes (p. 817)
18.1 Generic Classes and Type Parameters (p. 818)
18.2 Implementing Generic Types (p. 819)
18.3 Generic Methods (p. 823)
18.4 Constraining Type Parameters (p. 825)
18.5 Type Erasure (p. 829)
Chapter 18 Streams And Binary Input/Output (p. 839)
19.1 Readers, Writers, and Streams (p. 840)
19.2 Binary Input and Output (p. 841)
19.3 Random Access (p. 845)
19.4 Object Streams (p. 851)
Chapter 20 Multithreading (Web Only)
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 (Web Only)
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 (Web Only)
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 (Web Only)
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 (Web Only)
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 (p. 861)
APPENDIX B Java Operator Summary (p. 865)
APPENDIX C Java Reserved Word Summary (p. 867)
APPENDIX D The Java Library (p. 869)
APPENDIX E Java Syntax Summary (p. 913)
APPENDIX F Html Summary (p. 925)
APPENDIX G Tool Summary (p. 931)
APPENDIX H Javadoc Summary (p. 933)
APPENDIX I Number Systems (p. 935)
APPENDIX J Bit And Shift Operations (p. 941)
APPENDIX K Uml Summary (p. 943)
APPENDIX L Java Language Coding Guidelines (p. 947)
Glossary (p. 955)
Index (p. 969)
Credits (p. 1011)

Author notes provided by Syndetics

Cay S. Horstmann is a Professor of Computer Science in the Department of Computer Science at San Jose State University. He is an experienced professional programmer and was Vice President and Chief Technology Officer for Preview Systems, Inc. He is also a consultant for major corporations, universities, and organizations on Java, C++, Windows, and Internet programming. Horstmann is the author of many successful professional and academic books, including Big C++, C++ for Everyone, Big Java, and Big Java: Late Objects --all with John Wiley & Sons, Inc.