AP Computer Science A
Free study guide.

1.1 Introduction to Algorithms, Programming, and Compilers 10m 1.2 Variables and Data Types 10m 1.3 Expressions and Output 10m 1.4 Assignment Statements and Input 10m 1.5 Casting and Range of Variables 10m 1.6 Compound Assignment Operators 10m 1.7 Application Program Interface (API) and Libraries 10m 1.8 Documentation with Comments 10m 1.9 Method Signatures 10m 1.10 Calling Class Methods 10m 1.11 Math Class 10m 1.12 Objects: Instances of Classes 10m 1.13 Object Creation and Storage (Instantiation) 11m 1.14 Calling Instance Methods 10m 1.15 String Manipulation 10m

2.1 Algorithms with Selection and Repetition 10m 2.2 Boolean Expressions 9m 2.3 if Statements 10m 2.4 Nested if Statements 10m 2.5 Compound Boolean Expressions 10m 2.6 Comparing Boolean Expressions 10m 2.7 while Loops 10m 2.8 for Loops 10m 2.9 Implementing Selection and Iteration Algorithms 11m 2.10 Implementing String Algorithms 12m 2.11 Nested Iteration 11m 2.12 Informal Run-Time Analysis 10m

3.1 Abstraction and Program Design 10m 3.2 Impact of Program Design 10m 3.3 Anatomy of a Class 11m 3.4 Constructors 11m 3.5 Methods: How to Write Them 10m 3.6 Methods: Passing and Returning References of an Object 10m 3.7 Class Variables and Methods 10m 3.8 Scope and Access 10m 3.9 this Keyword 12m

4.1 Ethical and Social Issues Around Data Collection 10m 4.2 Introduction to Using Data Sets 11m 4.3 Array Creation and Access 10m 4.4 Array Traversals 10m 4.5 Implementing Array Algorithms 10m 4.6 Using Text Files 12m 4.7 Wrapper Classes 11m 4.8 ArrayList Methods 11m 4.9 ArrayList Traversals 11m 4.10 Implementing ArrayList Algorithms 11m 4.11 2D Array Creation and Access 11m 4.12 2D Array Traversals 11m 4.13 Implementing 2D Array Algorithms 10m 4.14 Searching Algorithms 11m 4.15 Sorting Algorithms 10m 4.16 Recursion 10m 4.17 Recursive Searching and Sorting 11m