Cracking the AP Computer Science, 2004-2005The Princeton Review, 2004. gada 10. febr. - 512 lappuses The Princeton Review realizes that acing the AP Computer Science Exam is very different from getting straight A's in school. We don't try to teach you everything there is to know about computer science-only what you'll need to score higher on the exam. There's a big difference. In Cracking the AP Computer Science A & AB Exams, we'll teach you how to think like the test makers and -Focus on what the AP testers really want you to know with a complete review of Java language used on the exam -Learn techniques to help you navigate the multiple-choice and free-response questions -Brush up specific skills with practice questions throughout the book and full-length practice tests for the AP Computer Science A and AB exams This book includes 2 full-length practice tests, one each for the AP Computer Science A and AB exams. All of our practice test questions are like the ones you'll see on the actual exam, and we fully explain every answer. |
Saturs
JAVA FUNDAMENTALS | 15 |
Evaluating Boolean Expressions | 24 |
Synopsis | 34 |
DESIGNING TESTING AND PERFORMANCE | 43 |
OBJECTORIENTED DESIGN AND PROGRAMMING | 57 |
JAVA LIBRARY CLASSES | 85 |
RECURSION | 113 |
ARRAYS AND THE ARRAYLIST CLASS | 129 |
Priority Queues | 181 |
Hashtable | 193 |
SOLUTIONS TO CHAPTER REVIEW QUESTIONS | 233 |
THE MARINE BIOLOGY SIMULATION CASE STUDY | 261 |
THE PRINCETON REVIEW AP COMPUTER SCIENCE A PRACTICE | 323 |
ANSWERS AND EXPLANATIONS TO THE PRACTICE TEST | 373 |
THE PRINCETON REVIEW AP COMPUTER SCIENCE AB PRACTICE | 397 |
ANSWERS AND EXPLANATIONS TO THE PRACTICE TEST | 451 |
ADVANCED COLLECTION CLASSES AB ONLY | 151 |
DATA STRUCTURES AB ONLY | 167 |
GNU LICENSE AGREEMENT | 479 |
Bieži izmantoti vārdi un frāzes
algorithm answer choice AP Computer Science AP exam array ArrayList assigned binary search tree binary tree BoundedEnv color compareTo Consider the following constructor correct create DarterFish Difranco direction double doubly linked list empty equal example Fish class following code segment free-response grades implementation inorder insert insertion sort int index integer Iterator Java linked list LinkedList ListIterator ListNode Locatable obj Location loc look loop Marine Biology Simulation mergesort method returns move multiple-choice mystery nextLocation node node's Note null oldLoc output parameters pixel postcondition postorder traversal precondition Princeton Review printed private data field private int problem public boolean public class public int public static public void question queue quicksort random RBTreeNode recursive red-black tree reference remove returns false Returns the number returns true retval right child selection sort SlowFish sort SPACE FOR SCRATCHWORK stack statement String object Student System.out.print timestep toString TreeMap TreeNode variable