Fundamentals of Java : AP Computer Science Essentials for the A and AB Exams,9780619267230

Fundamentals of Java : AP Computer Science Essentials for the A and AB Exams

by ;
Edition: 3rd
ISBN13: 9780619267230
ISBN10: 0619267232
Format: Hardcover
Pub. Date: 2006-03-02
Publisher(s): Cengage Learning
Upgraded Edition: Click here!
List Price: $208.90

Rent Textbook

Select for Price
Add to Cart
There was a problem. Please try again later.

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

Buy from our Marketplace starting at $4.40

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

Unit 1: Getting Started with Java 1. Background 2. First Java Program 3. Syntax, Errors, and Debugging 4. Introdcution to Control Statements Unit 1 Review Unit 2: The Next Step with Java 5. Introduction to Defining Classes 6. Control Statements Continued 7. Improving the User Interface 8. Introduction to HTML and Applets Unit 2 Review Unit 3: Arrays, Recursion, and Complexity 9. Introduction to Arrays 10. Classes Continued 11. Arrays Continued 12. Recursion, Complexity, and Searching and Sorting Unit 3 Review Unit 4: Using Abstract Data Types 13. Object-Oriented Analysis and Design 14. Linear Collections: Lists 15. Linear Collections: Stacks and Queues 16. Unordered Collections: Sets and Maps Unit 4 Review Unit 5: Implementing Abstract Data Types 17. Implementing Lists, Stacks, and Queues 18. Implementing Sets and Maps 19. Implementing Trees and Priority Queues Unit 5 Review Appendices A: Java Resources B: Java Language Elements C: Operator Precedence D: ASCII Character Set E: Number Systems F: Java Exception Handling G: Java Packages H: Java File Streams I: Turtle Graphics J: A/P Correlations

Table of Contents

AP* Computer Science Review Companion for Fundamentals of Java iii
Preface v
UNIT 1 Getting Started with Java
Background
3(28)
History of Computers
3(2)
Computer Hardware and Software
5(5)
Binary Representation of Information and Computer Memory
10(9)
Programming Languages
19(1)
The Software Development Process
20(3)
Basic Concepts of Object-Oriented Programming
23(8)
Summary
28(3)
First Java Programs
31(26)
Why Java?
31(1)
The Java Virtual Machine and Byte Code
32(1)
Choosing a User Interface Style
33(1)
Hello World
34(3)
Edit, Compile, and Execute
37(5)
Temperature Conversion
42(4)
Graphics and GUIs: Windows and Panels
46(11)
Summary
52(5)
Syntax, Errors, and Debugging
57(48)
Language Elements
57(2)
Basic Java Syntax and Semantics
59(15)
Terminal I/O for Different Data Types
74(3)
Comments
77(5)
Programming Errors
82(5)
Debugging
87(5)
Graphics and GUIs: Drawing Shapes and Text
92(13)
Summary
100(5)
Introduction to Control Statements
105(50)
Additional Operators
105(2)
Standard Classes and Methods
107(2)
A Visit to the Farm
109(2)
The if and if-else Statements
111(5)
The while Statement
116(4)
The for Statement
120(4)
Nested Control Statements and the break Statement
124(3)
Using Loops with Text Files
127(6)
Errors in Loops
133(4)
Graphics and GUIs: I/O Dialog Boxes and Loops
137(18)
Design, Testing, and Debugging Hints
143(1)
Summary
144(5)
Unit Review
149(6)
UNIT 2 The Next Step with Java
Introduction to Defining Classes
155(44)
The Internal Structure of Classes and Objects
155(2)
A Student Class
157(11)
Editing, Compiling, and Testing the Student Class
168(6)
The Structure and Behavior of Methods
174(3)
Scope and Lifetime of Variables
177(6)
Graphics and GUIs: Images, a Circle Class, and Mouse Events
183(16)
Summary
194(5)
Control Statements Continued
199(48)
Logical Operators
199(13)
Testing if Statements
212(3)
Nested if Statements
215(3)
Logical Errors in Nested if Statements
218(4)
Nested Loops
222(2)
Testing Loops
224(4)
Loop Verification
228(6)
Graphics and GUIs: Timers and Animations
234(13)
Design, Testing, and Debugging Hints
241(1)
Summary
242(5)
Improving the User Interface
247(22)
A Thermometer Class
247(1)
Repeating Sets of Inputs
248(1)
A Menu-Driven Conversion Program
249(3)
Formatted Output with printf and format
252(5)
Handling Number Format Exceptions during Input
257(1)
Graphics and GUIs
258(11)
Summary
265(4)
Introduction to HTML and Applets
269(36)
Hypertext, Hypermedia, and the World Wide Web
269(2)
Overview of the Hypertext Markup Language
271(4)
Simple Text Elements
275(2)
Character-Level Formatting
277(1)
Lists
278(3)
Linking to Other Documents
281(2)
Multimedia
283(3)
Tables
286(2)
Applets
288(17)
Summary
295(4)
Unit Review
299(6)
UNIT 3 Arrays, Recursion, and Complexity
Introduction to Arrays
305(46)
Conceptual Overview
306(1)
Simple Array Manipulations
307(2)
Looping Through Arrays
309(2)
Declaring Arrays
311(3)
Working with Arrays That Are Not Full
314(3)
Parallel Arrays
317(1)
Two-Dimensional Arrays
318(3)
Using the Enhanced for Loop
321(2)
Arrays and Methods
323(3)
Arrays of Objects
326(12)
Graphics and GUIs: Changing the View of Student Test Scores
338(13)
Design, Testing, and Debugging Hints
343(1)
Summary
343(8)
Classes Continued
351(54)
Class (static) Variables and Methods
352(4)
TurtleGraphics
356(3)
Java Interfaces---The Client Perspective
359(3)
Java Interfaces---The Implementation Perspective
362(5)
Code Reuse Through Inheritance
367(5)
Inheritance and Abstract Classes
372(5)
Some Observations about Interfaces, Inheritance, and Relationships among Classes
377(3)
Acceptable Classes for Parameters and Return Values
380(3)
Error Handling with Classes
383(2)
Exceptions
385(7)
Reference Types, Equality, and Object Identity
392(3)
Graphics and GUIs: Drawing Multiple Shapes
395(10)
Summary
402(3)
Arrays Continued
405(50)
Advanced Operations on Strings
405(6)
Searching
411(4)
Sorting
415(7)
Insertions and Removals
422(4)
Working with Arrays of Objects
426(3)
The Class java.util.ArrayList
429(13)
Graphics and GUIs: Menus
442(13)
Summary
450(5)
Recursion, Complexity, and Searching and Sorting
455(52)
Recursion
456(12)
Complexity Analysis
468(7)
Binary Search
475(3)
Quicksort
478(4)
Merge Sort
482(7)
Graphics and GUIs: Drawing Recursive Patterns
489(18)
Design, Testing, and Debugging Hints
497(1)
Summary
497(4)
Unit Review
501(6)
UNIT 4 Using Abstract Data Types
Object-Oriented Analysis and Design
507(50)
Introduction
508(1)
Overview of Analysis and Design
509(1)
Request
510(1)
Analysis
511(11)
Interlude: Support Classes for Menu-Driven Programs
522(6)
Design
528(8)
Implementation
536(8)
Graphics and GUIs: Text Areas, Scrolling List Boxes, and a GUI-Based Adventure Game
544(13)
Summary
553(4)
Linear Collections: Lists
557(26)
Overview of Collections
558(4)
Lists
562(10)
Iterators
572(11)
Summary
578(5)
Linear Collections: Stacks and Queues
583(42)
Stacks
583(13)
The StringTokenizer Class
596(5)
Queues and Priority Queues
601(16)
Graphics and GUIs: Check Boxes and Radio Buttons
617(8)
Summary
620(5)
Unordered Collections: Sets and Maps
625(34)
Sets
626(3)
Sorted Sets
629(3)
Example Application: Word Frequencies
632(2)
Maps
634(4)
Sorted Maps
638(6)
The Glue that Holds Collections Together
644(15)
Summary
649(4)
Unit Review
653(6)
UNIT 5 Implementing Abstract Data Types
Implementing Lists
659(36)
Interfaces, Multiple Implementations, and Prototypes
659(2)
The IndexedList Interface
661(2)
The Fixed-Size Array Implementation of Indexed Lists
663(1)
The Singly Linked Implementation of Indexed Lists
664(10)
Complexity Analysis of Indexed List Implementations
674(3)
Positional Lists
677(5)
Fixed-Size Array Implementation of Positional Lists
682(3)
Doubly Linked Implementation of Positional Lists
685(5)
Complexity Analysis of Positional Lists
690(1)
Iterators
691(4)
Summary
691(4)
Implementing Sets and Maps
695(20)
The Set and Map Prototypes
696(2)
List Implementations of Sets and Maps
698(1)
Overview of Hashing
699(5)
Hashing Implementation of Maps
704(5)
Hashing Implementation of Sets
709(6)
Summary
712(3)
Implementing Trees and Priority Queues
715
An Overview of Trees
715(9)
Binary Tree Traversals
724(3)
A Linked Implementation of Binary Trees
727(10)
An Array Implementation of Binary Trees
737(3)
Implementing Heaps
740(3)
Using a Heap to Implement a Priority Queue
743
Summary
744(5)
Unit Review
749
Appendix A Java Resources 1(1)
Appendix B Java Language Elements 1(1)
Appendix C Operator Precedence 1(1)
Appendix D ASCII Character Set 1(1)
Appendix E Number Systems 1(1)
Appendix F Java Exception Handling 1(1)
Appendix G Java Packages and jar Files 1(1)
Appendix H Files 1(1)
Appendix I The TurtleGraphics Package 1(1)
Appendix J AP Correlations 1(1)
Glossary 1(1)
Index 1

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.