AP computer science A 2018 / Dean R. Johnson, Carol A. Paymer, Aaron P. Chamberlain
Material type: TextSeries: Publisher: New York : McGraw-Hill Education, 2017Description: xx, 489 pages : illlustrations ; 28cmISBN: 9781260010336Subject(s): Advanced placement programs (Education) | Advanced placement programs (Education) Study guides | Computer science examinations | Computer science examinations Study guidesDDC classification: 004.076Item type | Current location | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
Books | Philippine Christian University Manila Circulation | Junior High School | 004.076 C738 2017 (Browse shelf) | 1 | Available | MJH12045 |
Step 1: Set Up Your Study Program -- 1. What you Need to Know About the AP Computer Science A Exam -- 2. How to Plan Your Time -- Step 2: Determine Your Test Readiness -- 3. Take a Diagnostic Exam -- Step 3: Develop Strategies for Success -- 4: Strategies to Help You Do Your Best on the Exam -- Step 4: Review the Knowledge You Need to Score High -- Concept 0: Background on Software Development -- What is Java? -- What Is a Software Developer? -- What Is OOP (Object-Oriented Programming? -- Viewing the World Through the Eyes of a Software Developer -- For the Good of All Humankind -- Choosing Your IDE -- HelloWorld -- Rapid Review -- Concept 1: Fundamentals of Programming -- Introduction -- Syntax -- The Console Screen -- Primitive Variables -- Mathematical Operations -- Modifying Number Variables -- Relational Operators -- Logical Operations -- Conditional Statements -- Looping Statements -- Bases Other than Decimal -- Commenting Your Code -- Types of Errors -- Rapid Review -- Review Questions -- Answers and Explanations -- Concept 2: Classes and Objects (Basic Version) -- Overview of the Relationship Between Classes and Objects -- The class Declaration -- Instance Variables -- Constructors -- Methods -- Putting It All Together: The Circle and CircleRunner Classes -- Understanding the Keyword new When Constructing an Object -- The Reference Variable Versus the Actual Object -- The null Reference -- Rapid Review -- Review Questions -- Answers and Explanations -- Concept 3: The String Class -- The String Variable -- The String Object -- A Visual Representation of a String Object -- String Concatenation -- The Correct Way to Compare Two String Objects -- Important String Methods -- A String Is Immutable -- Escape Sequences -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 4: The Math, Interger, and Double Classes -- The Java API and the AP Computer Science A Exam Subset -- The Math Class -- The Interger Class -- The Double Class -- Summary of the Interger and Double Classes -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 5: Data Structures -- What Is a Data Structure? -- The Array -- The 2-D Array -- The ArrayList -- Important ArrayList Methods -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 6: Algorithms (Basic Version) -- How We Use Algorithms -- Why Algorithms Are Important -- Algorithm Versus Pseudocode Versus Real Java Code -- The Swap Algorithm -- The Copt Algorithm for the Array and ArrayList -- The Sequential Search Algorithm -- The Accumulate Algorithm -- The Find-Highest Algorithm -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 7: Classes and Objects (Advanced Version) -- Parameters -- Overloaded Constructors -- Overloaded Methods -- static, static, static -- Data Encapsulation -- Scope -- Documentation -- The Keyword this -- IllegalArgumentException -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 8: Inheritance and Polymorphism -- Inheritance -- Polymorphism -- The object Class -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 9: The abstract class and the interface -- The abstract class -- The interface -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 10: Recursion -- Recursion Versus Looping -- The Base Case -- Beginner Example: The Factorial Recursive method -- Advanced Example: The Fibonacci Recursive Method -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 11: Algorithms (Advanced Version) -- The Accumulate Advanced Algorithm -- The Find-Highest Advanced Algorithm -- The Connect-Four Advanced Algorithm -- The Twitter-Sentiment-Analysis and Advanced Algorithm -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 12: Sorting Algorithms and the Binary Search -- Background on Sorting Data -- Insertion Sort -- Selection Sort -- Merge Sort -- Binary Search -- Rapid Review -- Review Questions -- Answer and Explanations -- Concept 13: Seeing the Big Picture: Design -- The Software Development Cycle -- Desgining Class Hierarchy -- Testing -- Rapid Review -- Review Questions -- Answer and Explanations -- Step 5: Building Your Test-Taking Confidence -- AP Computer Science A: Practice Exam 1 -- AP Computer Science A: Practice Exam 2
5 Steps to a 5: AP Computer Science introduces an easy to follow, effective 5-step study plan to help you build the skills, knowledge, and test-taking confidence you need to achieve a high score on the exam. This wildly popular test prep guide matches the latest course syllabus and the latest exam. You'll get two full-length practice tests, detailed answers to each question, study tips, information on how the exam is scores, and much more.
There are no comments on this title.