Image from Google Jackets

Java Software Solutions for AP Computer Science.

By: Contributor(s): Material type: TextTextEdition: 3rd edDescription: 1 online resource (665 pages)ISBN:
  • 9788131743430
Genre/Form: Additional physical formats: Print version:: Java Software Solutions for AP Computer ScienceDDC classification:
  • 23 005.13
Online resources:
Contents:
Cover -- Contents -- Preface -- AP* Correlation Guide -- Chapter 1 Computer Systems -- 1.0 Introduction -- Basic Computer Processing -- Software Categories -- Digital Computers -- Binary Numbers -- 1.1 Hardware Components -- Computer Architecture -- Input/Output Devices -- Main Memory and Secondary Memory -- The Central Processing Unit -- 1.2 Networks -- Network Connections -- Local-area Networks and Wide-area Networks -- The Internet -- The World Wide Web -- Uniform Resource Locators -- The Internet vs. The World Wide Web -- 1.3 Programming -- Problem Solving -- The Java Programming Language -- A Java Program -- Comments -- Identifiers and Reserved Words -- White Space -- 1.4 Programming Languages -- Programming Language Levels -- Compilers and Interpreters -- Syntax and Semantics -- Errors -- Language Evolution -- 1.5 Graphics -- Coordinate Systems -- Representing Color -- Chapter 2 Objects and Primitive Data -- 2.0 An Introduction to objects -- 2.1 Using Objects -- The print and println Methods -- Abstraction -- 2.2 String Literals -- String Concatenation -- Escape Sequences -- 2.3 Variables and Assignment -- Variables -- The Assignment Statement -- Constants -- 2.4 Primitive Data Types -- Integers and Floating Points -- Booleans -- Characters -- 2.5 Arithmetic Expressions -- Operator Precedence -- Data Conversion -- 2.6 Enumerated Types -- 2.7 Creating Objects -- The String Class -- Wrapper Classes -- Autoboxing -- 2.8 Class Libraries and Packages -- The Import Declaration -- The Random Class -- The Math Class -- 2.9 Interactive Programs -- The Scanner Class -- 2.10 Formatting Output -- The NumberFormat Class -- The DecimalFormat Class -- The Printf Method -- 2.11 An Introduction to Applets -- Executing Applets Using the Web -- 2.12 Drawing Shapes -- The Graphics Class -- The Color Class -- Chapter 3 Program Statements.
3.0 Program Development -- 3.1 Control Flow -- 3.2 The if Statement -- Equality and Relational Operators -- The if-else Statement -- Using Block Statements -- Nested if Statements -- 3.3 Boolean Expressions Revisited -- Logical Operators -- Comparing Characters and Strings -- Comparing Floating Point Values -- 3.4 More Operators -- Increment and Decrement Operators -- Assignment Operators -- 3.5 The While Statement -- Infinite Loops -- Nested Loops -- 3.6 Iterators -- Reading Text Files -- 3.7 The For Statement -- Iterators and for Loops -- Comparing Loops -- 3.8 Program Development Revisited -- 3.9 Drawing Using Conditionals and Loops -- Chapter 4 Writing Classes -- 4.0 Objects Revisited -- Classes -- 4.1 Anatomy of a Class -- Instance Data -- Encapsulation and Visibility Modifiers -- 4.2 Anatomy of a Method -- The Return Statement -- Parameters -- Preconditions and Postconditions -- Constructors -- Local Data -- Accessors and Mutators -- 4.3 Method Overloading -- 4.4 Method Decomposition -- 4.5 Object Relationships -- Association -- Association Between Objects of the Same Class -- Aggregation -- 4.6 Applet Methods -- 4.7 Graphical Objects -- Chapter 5 Enhancing Classes -- 5.0 References Revisited -- The Null Reference -- The This Reference -- Aliases -- Passing Objects as Parameters -- 5.1 The Static Modifier -- Static Variables -- Static Methods -- 5.2 Exceptions -- Exception Messages -- Throwing Exceptions -- 5.3 Interfaces -- The Comparable Interface -- The List Interface -- The Iterator and ListIterator Interfaces -- 5.4 Identifying Classes and Objects -- Designing Classes -- Testing and Debugging -- 5.5 Nested Classes -- Inner Classes -- 5.6 Dialog Boxes -- 5.7 Graphical User Interfaces -- Essential GUI Elements -- Creating GUIs -- GUI Applications -- Chapter 6 Arrays -- 6.0 Arrays -- Array Indexing -- Declaring and Using Arrays.
Initializer Lists -- Arrays as Parameters -- 6.1 Arrays of Objects -- Arrays of String Objects -- Command-line Arguments -- Filling Arrays of Objects -- 6.2 Searching -- Comparing Searches -- 6.3 Sorting -- Selection Sort -- Insertion Sort -- Sorting an Array of Objects -- 6.4 Comparing Sorts -- 6.5 Hashing -- 6.6 Two-dimensional Arrays -- 6.7 The ArrayList Class -- Specifying an ArrayList Element Type -- Using a ListIterator -- ArrayList Efficiency -- 6.8 Polygons and Polylines -- The Polygon Class -- 6.9 Other Button Components -- Check Boxes -- Radio Buttons -- Chapter 7 Inheritance -- 7.0 Creating Subclasses -- Derived Classes -- The Super Reference -- Multiple Inheritance -- 7.1 Overriding Methods -- 7.2 Class Hierarchies -- The Object Class -- Abstract Classes -- 7.3 Indirect Use of Class Members -- 7.4 Designing for Inheritance -- 7.5 Polymorphism -- References and Class Hierarchies -- Polymorphism and Inheritance -- 7.6 Interfaces -- Polymorphism with Interfaces -- 7.7 Designing for Polymorphism -- 7.8 Inheritance and GUIs -- Applets -- The Component Class Hierarchy -- 7.9 Mouse Events -- Extending Event Adapter Classes -- Chapter 8 Recursion -- 8.0 Recursive Thinking -- Infinite Recursion -- Recursion in Math -- 8.1 Recursive Programming -- Recursion vs. Iteration -- Direct vs. Indirect Recursion -- 8.2 Using Recursion -- Solving a Maze -- The Towers of Hanoi -- 8.3 Recursion in Sorting -- Merge Sort -- Quick Sort -- 8.4 Recursion in Graphics -- Tiled Pictures -- Fractals -- Chapter 9 Linear Data Structures -- 9.0 Collections -- Separating Interface from Implementation -- Java API Collection Classes -- Generics -- 9.1 Representing Data Structures -- Dynamic Structures -- Managing Linked Lists -- Inserting Nodes -- Deleting Nodes -- A Dynamically Linked List Example -- Other Dynamic List Representations -- LinkedList -- 9.2 Queues and Stacks.
Queues -- Stacks -- Chapter 10 Non-linear Data Structures -- 10.0 Sets and Maps -- 10.1 Trees -- Tree Traversal -- Binary Search Trees -- TreeSet and TreeMap -- 10.2 Heaps -- Heapsort -- Implementing Heaps -- 10.3 More on Hashtables -- Handling Collisions -- HashSet and HashMap -- Appendix A: Glossary -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Appendix B: The Unicode Character Set -- Appendix C: Java Operators -- Appendix D: The Java Class Library -- Appendix E: Number Systems -- Appendix F: Responsible Use of Computer Systems -- Index -- Symbols -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Z.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Materials specified Status Barcode
E- Books E- Books Digital Library Digital Library 005.13 Online access Available E0113
Total holds: 0

Cover -- Contents -- Preface -- AP* Correlation Guide -- Chapter 1 Computer Systems -- 1.0 Introduction -- Basic Computer Processing -- Software Categories -- Digital Computers -- Binary Numbers -- 1.1 Hardware Components -- Computer Architecture -- Input/Output Devices -- Main Memory and Secondary Memory -- The Central Processing Unit -- 1.2 Networks -- Network Connections -- Local-area Networks and Wide-area Networks -- The Internet -- The World Wide Web -- Uniform Resource Locators -- The Internet vs. The World Wide Web -- 1.3 Programming -- Problem Solving -- The Java Programming Language -- A Java Program -- Comments -- Identifiers and Reserved Words -- White Space -- 1.4 Programming Languages -- Programming Language Levels -- Compilers and Interpreters -- Syntax and Semantics -- Errors -- Language Evolution -- 1.5 Graphics -- Coordinate Systems -- Representing Color -- Chapter 2 Objects and Primitive Data -- 2.0 An Introduction to objects -- 2.1 Using Objects -- The print and println Methods -- Abstraction -- 2.2 String Literals -- String Concatenation -- Escape Sequences -- 2.3 Variables and Assignment -- Variables -- The Assignment Statement -- Constants -- 2.4 Primitive Data Types -- Integers and Floating Points -- Booleans -- Characters -- 2.5 Arithmetic Expressions -- Operator Precedence -- Data Conversion -- 2.6 Enumerated Types -- 2.7 Creating Objects -- The String Class -- Wrapper Classes -- Autoboxing -- 2.8 Class Libraries and Packages -- The Import Declaration -- The Random Class -- The Math Class -- 2.9 Interactive Programs -- The Scanner Class -- 2.10 Formatting Output -- The NumberFormat Class -- The DecimalFormat Class -- The Printf Method -- 2.11 An Introduction to Applets -- Executing Applets Using the Web -- 2.12 Drawing Shapes -- The Graphics Class -- The Color Class -- Chapter 3 Program Statements.

3.0 Program Development -- 3.1 Control Flow -- 3.2 The if Statement -- Equality and Relational Operators -- The if-else Statement -- Using Block Statements -- Nested if Statements -- 3.3 Boolean Expressions Revisited -- Logical Operators -- Comparing Characters and Strings -- Comparing Floating Point Values -- 3.4 More Operators -- Increment and Decrement Operators -- Assignment Operators -- 3.5 The While Statement -- Infinite Loops -- Nested Loops -- 3.6 Iterators -- Reading Text Files -- 3.7 The For Statement -- Iterators and for Loops -- Comparing Loops -- 3.8 Program Development Revisited -- 3.9 Drawing Using Conditionals and Loops -- Chapter 4 Writing Classes -- 4.0 Objects Revisited -- Classes -- 4.1 Anatomy of a Class -- Instance Data -- Encapsulation and Visibility Modifiers -- 4.2 Anatomy of a Method -- The Return Statement -- Parameters -- Preconditions and Postconditions -- Constructors -- Local Data -- Accessors and Mutators -- 4.3 Method Overloading -- 4.4 Method Decomposition -- 4.5 Object Relationships -- Association -- Association Between Objects of the Same Class -- Aggregation -- 4.6 Applet Methods -- 4.7 Graphical Objects -- Chapter 5 Enhancing Classes -- 5.0 References Revisited -- The Null Reference -- The This Reference -- Aliases -- Passing Objects as Parameters -- 5.1 The Static Modifier -- Static Variables -- Static Methods -- 5.2 Exceptions -- Exception Messages -- Throwing Exceptions -- 5.3 Interfaces -- The Comparable Interface -- The List Interface -- The Iterator and ListIterator Interfaces -- 5.4 Identifying Classes and Objects -- Designing Classes -- Testing and Debugging -- 5.5 Nested Classes -- Inner Classes -- 5.6 Dialog Boxes -- 5.7 Graphical User Interfaces -- Essential GUI Elements -- Creating GUIs -- GUI Applications -- Chapter 6 Arrays -- 6.0 Arrays -- Array Indexing -- Declaring and Using Arrays.

Initializer Lists -- Arrays as Parameters -- 6.1 Arrays of Objects -- Arrays of String Objects -- Command-line Arguments -- Filling Arrays of Objects -- 6.2 Searching -- Comparing Searches -- 6.3 Sorting -- Selection Sort -- Insertion Sort -- Sorting an Array of Objects -- 6.4 Comparing Sorts -- 6.5 Hashing -- 6.6 Two-dimensional Arrays -- 6.7 The ArrayList Class -- Specifying an ArrayList Element Type -- Using a ListIterator -- ArrayList Efficiency -- 6.8 Polygons and Polylines -- The Polygon Class -- 6.9 Other Button Components -- Check Boxes -- Radio Buttons -- Chapter 7 Inheritance -- 7.0 Creating Subclasses -- Derived Classes -- The Super Reference -- Multiple Inheritance -- 7.1 Overriding Methods -- 7.2 Class Hierarchies -- The Object Class -- Abstract Classes -- 7.3 Indirect Use of Class Members -- 7.4 Designing for Inheritance -- 7.5 Polymorphism -- References and Class Hierarchies -- Polymorphism and Inheritance -- 7.6 Interfaces -- Polymorphism with Interfaces -- 7.7 Designing for Polymorphism -- 7.8 Inheritance and GUIs -- Applets -- The Component Class Hierarchy -- 7.9 Mouse Events -- Extending Event Adapter Classes -- Chapter 8 Recursion -- 8.0 Recursive Thinking -- Infinite Recursion -- Recursion in Math -- 8.1 Recursive Programming -- Recursion vs. Iteration -- Direct vs. Indirect Recursion -- 8.2 Using Recursion -- Solving a Maze -- The Towers of Hanoi -- 8.3 Recursion in Sorting -- Merge Sort -- Quick Sort -- 8.4 Recursion in Graphics -- Tiled Pictures -- Fractals -- Chapter 9 Linear Data Structures -- 9.0 Collections -- Separating Interface from Implementation -- Java API Collection Classes -- Generics -- 9.1 Representing Data Structures -- Dynamic Structures -- Managing Linked Lists -- Inserting Nodes -- Deleting Nodes -- A Dynamically Linked List Example -- Other Dynamic List Representations -- LinkedList -- 9.2 Queues and Stacks.

Queues -- Stacks -- Chapter 10 Non-linear Data Structures -- 10.0 Sets and Maps -- 10.1 Trees -- Tree Traversal -- Binary Search Trees -- TreeSet and TreeMap -- 10.2 Heaps -- Heapsort -- Implementing Heaps -- 10.3 More on Hashtables -- Handling Collisions -- HashSet and HashMap -- Appendix A: Glossary -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Appendix B: The Unicode Character Set -- Appendix C: Java Operators -- Appendix D: The Java Class Library -- Appendix E: Number Systems -- Appendix F: Responsible Use of Computer Systems -- Index -- Symbols -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Z.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2018. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

Share
Powered by Koha ILS
Page Design & Customization: Library Web Team CE Thalassery