Cracking the AP Computer Science A & AB Exams, 2006-2007 Edition

by PRINCETON REVIEW

• ISBN13: 9780375765285
• ISBN10: 037576528X
• Additional ISBN(s): 9780375763830
• Format: Trade Paper
• Copyright: 2006-01-10
• Publisher: Princeton Review
• More Book Details
• Purchase Benefits

Summary

The Princeton Review realizes that scoring high on the AP Computer Science A & AB Exams is very different from earning straight A's in school. We don't try to teach you everything there is to know about computer scienceonly the strategies and information you'll need to get your highest score. InCracking the AP Computer Science A & AB Exams, we'll teach you how to Use our preparation strategies to raise your score Master the program design, testing, and performance issues found on the exam Test your knowledge with review questions for each topic covered This book includes 2 full-length practice tests, one each for Computer Science A and Computer Science AB. All of our practice questions simulate those you'll see on the actual exam, and we explain how to answer every question.

Table of Contents

Acknowledgments	v
Introduction	xi
About the AP Computer Science A and AB Exams	1	(14)
What Is the Advanced Placement Program?	1	(2)
How Your Exam Results Are Used by Colleges	3	(1)
Registering for the Exam	3	(1)
Students with Disabilities	3	(1)
What to Bring to the Exam	3	(1)
What Not to Bring	4	(1)
Cheaters Never Prosper	4	(1)
How to Get More Information	4	(1)
What Is Covered on the AP Computer Science A and AB Exams? What's the Difference?	4	(3)
How the Exam Is Scored	7	(1)
Test-Taking Strategies	8	(7)
Java Fundamentals	15	(28)
Introduction	15	(1)
Getting Started	16	(1)
Code Format	16	(1)
Input and Output	17	(1)
Variables	17	(3)
Operators	20	(4)
Evaluating Boolean Expressions	24	(2)
Control Structures	26	(8)
Synopsis	34	(1)
Review Questions	35	(8)
Designing, Testing, and Performance	43	(14)
Introduction	43	(1)
Designing a Program	44	(4)
Problem Identification
Top-Down Design
Object-Oriented Design
Implementation
Testing a Program	48	(3)
Types of Errors
Assertions
Preconditions
Postconditions
Boundary Test
Debugging Techniques
Unit Testing
Integration Testing
Measuring Performance	51	(3)
Big-Oh Notation (AB Only)
Worst-case Analysis
Average-case Analysis
Best-case Analysis
Deciding Which Case Applies
Review Questions (AB Only)	54	(3)
Object-Oriented Design and Programming	57	(28)
Introduction	57	(1)
Classes	58	(1)
Objects	58	(1)
Attributes and Methods	58	(1)
Access Modifiers	59	(2)
Method Overloading	61	(1)
Exceptions (AB Only)	61	(2)
Constructors	63	(2)
Encapsulation and Information Hiding	65	(1)
Abstract Classes	66	(1)
Interfaces	67	(1)
Inheritance	68	(1)
Extending a Class	68	(1)
HAS-A and IS-A Relationships	69	(1)
Method Overriding	69	(1)
Polymorphism	70	(1)
Casting	70	(2)
Review Questions	72	(13)
Java Library Classes	85	(28)
Introduction	85	(1)
The Object Class	86	(4)
The String Class	90	(9)
The Math Class	99	(1)
The Random Class	100	(2)
The Comparable Interface	102	(4)
The Integer Class	106	(2)
The Double Class	108	(2)
Review Questions	110	(3)
Recursion	113	(16)
Introduction	113	(1)
Understanding Recursion	114	(2)
Writing a Recursive Method	116	(1)
When to Use Recursion	116	(3)
Tracing a Call to a Recursive Method	119	(2)
Recursively Traversing Arrays	121	(1)
Recursion and Program Performance	122	(2)
Review Questions	124	(5)
Arrays and the ArrayList Class	129	(22)
Introduction	129	(1)
Arrays	130	(8)
The ArrayList Class	138	(6)
Summary: Arrays vs. ArrayLists	144	(1)
Review Questions	145	(6)
Advanced Collection Classes (AB Only)	151	(16)
Introduction	151	(1)
The LinkedList Class	152	(2)
The List Interface	154	(1)
The Iterator Interface	155	(3)
The Listlterator Interface	158	(1)
The Set Interface	159	(1)
HashSet and TreeSet Classes	160	(1)
The Map Interface	161	(3)
HashMap and TreeMap Classes	164	(1)
Review Questions	165	(2)
Data Structures (AB Only)	167	(32)
Introduction	167	(1)
Linked Lists	168	(7)
Stacks	175	(4)
Queues	179	(2)
Priority Queues	181	(1)
Trees	182	(5)
Inserting (Code Sample)	187	(6)
Hashtable	193	(1)
Review Questions	194	(5)
Searching and Sorting Algorithms	199	(30)
Introduction	199	(1)
Sequential Search	200	(3)
Binary Search	203	(6)
Sorting	209	(1)
Selection Sort	209	(3)
Insertion Sort	212	(3)
Mergesort	215	(3)
Quicksort (AB Only)	218	(3)
Heapsort (AB Only)	221	(3)
Summary	224	(3)
Review Questions	227	(2)
Solutions to Chapter Review Questions	229	(28)
The Marine Biology Simulation Case Study	257	(62)
Introduction	257	(1)
Overview	258	(1)
Utility Classes and Interfaces	259	(9)
Core Classes and Interfaces	268	(25)
Data Files	293	(1)
Types of Questions	294	(1)
Source Code	294	(25)
The Princeton Review AP Computer Science A Practice Test	319	(50)
Answers and Explanations to the Practice Test	369	(24)
The Princeton Review AP Computer Science AB Practice Test	393	(54)
Answers and Explanations to the Practice Test	447	(28)
Appendix: GNU License Agreement	475	(8)
Index	483	(6)
About the Authors	489