AP Computer Science A
Mostly Everything You Need to Know About AP CSA
Exam Outline
Section 1: Multiple Choice
Questions | Time | Exam Weight |
---|---|---|
40 | 90 minutes | 50% |
Section 2: Free Response
Questions | Time | Exam Weight |
---|---|---|
4 | 90 minutes | 50% |
A Java Quick Reference sheet will be provided for the exam.
Course Content
Unit 1: Primitive Types
2.5%-5% of Exam Score
1.1 Why Programming? Why Java?
1.2 Variables and Primitive Data Types
1.3 Expressions and Assignment Statements
1.4 Compound Assignment Operators
1.5 Casting and Ranges of Variables
Unit 2: Using Objects
5%–7.5% of Exam Score
2.1 Using Objects Overview and Instances of Classes
2.2 Creating and Storing Objects (Instantiation)
2.3 Calling a Void Method
2.4 Calling a Void Method With Parameters
2.5 Calling a Non-Void Method
2.6 String Objects: Concatenation, Literals, and More
2.7 String Methods
2.8 Wrapper Classes: Integer and Double
2.9 Using the Math Class
Unit 3: Boolean Expressions and If Statements
15%–17.5% of Exam Score
3.1 Boolean Expressions
3.2 If Statements and Control Flow
3.3 If-Else Statements
3.4 Else-If Statements
3.5 Compound Boolean Expressions
3.6 Equivalent Boolean Expressions
3.7 Comparing Objects
Unit 4: Iteration
17.5%–22.5% of Exam Score
4.1 While Loops
4.2 For Loops
4.3 Developing Algorithms Using Strings
4.4 Nested Iteration
4.5 Informal Code Analysis
Unit 5: Writing Classes
5%–7% of Exam Score
5.1 Anatomy of a Class
5.2 Constructors
5.3 Documentation With Comments
5.4 Accessor Methods
5.5 Mutator Methods
5.6 Writing Methods
5.7 Static Variables and Methods
5.8 Scope and Access
5.9 This Keyword
5.10 Ethical and Social Implications of Computing Systems
Unit 6: Array
10%–15% of Exam Score
6.1 Array Creation and Access
6.2 Traversing Arrays
6.3 Enhanced for Loop for Arrays
6.4 Developing Algorithms Using Arrays
Unit 7: ArrayList
2.5%–7.5% of Exam Score
7.1 Introduction to ArrayList
7.2 ArrayList Methods
7.3 Traversing ArrayLists
7.4 Developing Algorithms Using ArrayLists
7.5 Searching
7.6 Sorting
7.7 Ethical Issues Around Data Collection
Unit 8: 2D Array
7.5%–10% of Exam Score
8.1 2D Arrays
8.2 Traversing 2D Arrays
Unit 9: Inheritance
5%–10% of Exam Score
9.1 Creating Superclasses and Subclasses
9.2 Writing Constructors For Subclasses
9.3 Overriding Methods
9.4 Super Keyword
9.5 Creating References Using Inheritance Hierarchies
9.6 Polymorphism
9.7 Object Superclass
Unit 10: Recursion
5%–7.5% of Exam Score
10.1 Recursion
10.2 Recursive Searching and Sorting