Specification points
College Board AP Computer Science A computer-science-a
130 points in 4 topics, with College Board's codes and titles.
Codes and titles are read by a script from College Board's published specification and have not been checked by a person. What each point covers is in the specification itself: College Board’s specification.
1 Using Objects and Methods
- 1.1 Introduction to Algorithms, Programming, and Compilers
- 1.1.A Everyday patterns and algorithms in words or diagrams
- 1.1.B Compilation and execution
- 1.1.C Types of programming errors
- 1.2 Variables and Data Types
- 1.2.A Choosing a data type
- 1.2.B Variables for numbers and Booleans
- 1.3 Expressions and Output
- 1.3.A Producing output
- 1.3.B String literals
- 1.3.C Arithmetic expressions
- 1.4 Assignment Statements and Input
- 1.4.A Assignment statements
- 1.4.B Reading input
- 1.5 Casting and Range of Variables
- 1.5.A Casting primitive values
- 1.5.B Integer overflow
- 1.5.C Limits on accuracy of expressions
- 1.6 Compound Assignment Operators
- 1.6.A Compound assignment operators
- 1.7 Application Program Interface (API) and Libraries
- 1.7.A Classes in API libraries
- 1.8 Documentation with Comments
- 1.8.A Code comments
- 1.9 Method Signatures
- 1.9.A Choosing methods from signatures
- 1.9.B How to call methods
- 1.10 Calling Class Methods
- 1.10.A Calling class methods
- 1.11 Math Class
- 1.11.A Using the Math class
- 1.12 Objects: Instances of Classes
- 1.12.A Classes and objects
- 1.12.B Variables for reference types
- 1.13 Object Creation and Storage (Instantiation)
- 1.13.A Identifying constructors from signatures
- 1.13.B Variables for object references
- 1.13.C Creating objects with constructors
- 1.14 Calling Instance Methods
- 1.14.A Calling instance methods
- 1.15 String Manipulation
- 1.15.A Creating and combining strings
- 1.15.B String methods
2 Selection and Iteration
- 2.1 Algorithms with Selection and Repetition
- 2.1.A Everyday selection and repetition in words or diagrams
- 2.2 Boolean Expressions
- 2.2.A Boolean expressions with relational operators
- 2.3 if Statements
- 2.3.A Selection statements
- 2.4 Nested if Statements
- 2.4.A Nested selection
- 2.5 Compound Boolean Expressions
- 2.5.A Compound Boolean expressions
- 2.6 Comparing Boolean Expressions
- 2.6.A Equivalent Boolean expressions
- 2.6.B Comparing object references
- 2.7 while Loops
- 2.7.A When iteration is needed
- 2.7.B While loops
- 2.8 for Loops
- 2.8.A For loops
- 2.9 Implementing Selection and Iteration Algorithms
- 2.9.A Standard and original algorithms without data structures
- 2.10 Implementing String Algorithms
- 2.10.A String algorithms
- 2.11 Nested Iteration
- 2.11.A Nested iteration
- 2.12 Informal Run-Time Analysis
- 2.12.A Execution counts and informal run-time
3 Class Creation
- 3.1 Abstraction and Program Design
- 3.1.A Representing program design
- 3.2 Impact of Program Design
- 3.2.A Social and ethical implications of computing
- 3.3 Anatomy of a Class
- 3.3.A Access and visibility modifiers
- 3.4 Constructors
- 3.4.A Instance variables and constructors
- 3.5 Methods: How to Write Them
- 3.5.A Methods using primitive values
- 3.6 Methods: Passing and Returning References of an Object
- 3.6.A Methods using object references
- 3.7 Class Variables and Methods
- 3.7.A Class methods
- 3.7.B Class variables
- 3.8 Scope and Access
- 3.8.A Variable scope
- 3.9 this Keyword
- 3.9.A The this keyword
4 Data Collections
- 4.1 Ethical and Social Issues Around Data Collection
- 4.1.A Privacy risks of personal data
- 4.1.B Data quality in data sets
- 4.1.C Choosing a data set for a problem
- 4.2 Introduction to Using Data Sets
- 4.2.A Everyday data-set algorithms in words or diagrams
- 4.3 Array Creation and Access
- 4.3.A One-dimensional arrays
- 4.4 Array Traversals
- 4.4.A Traversing 1D arrays
- 4.5 Implementing Array Algorithms
- 4.5.A Array algorithms
- 4.6 Using Text Files
- 4.6.A Reading data from a text file
- 4.7 Wrapper Classes
- 4.7.A Wrapper classes Integer and Double
- 4.8 Array List Methods
- 4.8.A ArrayList objects
- 4.9 Array List Traversals
- 4.9.A Traversing ArrayLists
- 4.10 Implementing Array List Algorithms
- 4.10.A ArrayList algorithms
- 4.11 2D Array Creation and Access
- 4.11.A Two-dimensional arrays
- 4.12 2D Array Traversals
- 4.12.A Traversing 2D arrays
- 4.13 Implementing 2D Array Algorithms
- 4.13.A 2D array algorithms
- 4.14 Searching Algorithms
- 4.14.A Linear search
- 4.15 Sorting Algorithms
- 4.15.A Sorting algorithms
- 4.16 Recursion
- 4.16.A Recursive methods
- 4.17 Recursive Searching and Sorting
- 4.17.A Recursive algorithms with strings and collections
- 4.17.B Binary search
- 4.17.C Merge sort