Course at Primitive

a Glance
UNIT UNIT
Using Objects
1 Types 2
~8–10 Class
Periods 2.5–5% AP Exam
Weighting ~13–15 Class
Periods 5–7.5% AP Exam
Weighting

MOD 1.1 Why Programming? MOD 2.1 Objects: Instances of

Plan VAR Why Java? 5
Classes
The Course at a Glance provides 2
4
a useful visual organization MOD 2.2 Creating and Storing
of the AP Computer Science VAR 1.2 Variables and Data VAR Objects (Instantiation)
A curricular components, 1
Types 1
3
including the following:
CON 1.3 Expressions MOD 2.3 Calling a Void Method
§§ Sequence of units, along 1 and Assignment 1

with approximate weighting 2 Statements 3

and suggested pacing. CON 1.4 Compound Assignment

MOD 2.4 Calling a Void Method
Please note, pacing is based
2 with Parameters
2 Operators 3
5
on 45-minute class periods, MOD 2.5 Calling a Non-void
meeting five days each week CON 1.5 Casting and Ranges of 1 Method
for a full academic year.
2 Variables 3
5

§§ Progression of topics within VAR 2.6 String Objects:

each unit. Concatenation,
2
Literals, and More
§§ Spiraling of the big ideas and
practices across units.
VAR 2.7 String Methods
2
3

Teach VAR 2.8 Wrapper Classes:

COMPUTATIONAL THINKING Integer and Double
PRACTICES 2
Practices spiral across units.
MOD 2.9 Using the Math Class
1 Program Design 3 Code CON
and Algorithm Implementation
1
Development 3
4 Code Testing
2 Code Logic
5 Documentation

+ 

BIG IDEAS
Big ideas spiral across units.

MOD Modularity CON Control

VAR Variables IOC 

Assess
Assign the Personal Progress
Checks—either as homework
or in class—for each unit. Each
Personal Progress Check
contains formative multiple-
choice questions and formative Personal Progress Check 1 Personal Progress Check 2
free-response questions that are Multiple-choice: ~25 questions Multiple-choice: ~25 questions
Free-response: 1 question
written in a similar style to what
§§ Methods and Control Structures:
students will experience on the partial
end-of-year exam. Feedback from
the Personal Progress Checks
shows students the areas on NOTE: Partial versions of the free-response questions are provided to prepare students for
which they need to focus. more complex, full questions that they will encounter on the AP Exam.
V.1 | 22
© 2019 College Board

00762-118-CED-CSA_Introduction.indd 22 4/13/19 12:08 PM

 UNIT
Boolean UNIT UNIT
Expressions and Iteration Writing Classes
3 if Statements 4 5
~11–13 Class
Periods 15–17.5% AP Exam
Weighting ~14–16 Class
Periods 17.5–22.5
% AP Exam
Weighting ~12–14 Class
Periods 5–7.5% AP Exam
Weighting

CON 3.1 Boolean Expressions CON 4.1 while Loops MOD 5.1 Anatomy of a Class
2 + 1

CON 3.2 if Statements and CON 4.2 for Loops MOD 5.2 Constructors
2 Control Flow + 1
3 3
CON 4.3 Developing Algorithms
CON 3.3 if-else Statements 2 Using Strings
MOD 5.3 Documentation with
3 3 Comments
5
4
CON 4.4 Nested Iteration
CON 3.4 else if Statements MOD 5.4 Accessor Methods
3 + 3
4 5
CON 4.5 Informal Code Analysis
CON 3.5 Compound Boolean MOD 5.5 Mutator Methods
2
2 Expressions 3
3 4
CON 3.6 Equivalent Boolean MOD 5.6 Writing Methods
4 Expressions 1
3

CON MOD 5.7 Static Variables and

2 3 Methods
3 5

VAR 5.8 Scope and Access

3
5

VAR 5.9 this Keyword

2

IOC 5.10 Ethical and Social

Implications of
N/A Computing Systems

Personal Progress Check 3 Personal Progress Check 4 Personal Progress Check 5

Multiple-choice: ~20 questions
Free-response: 2 questions
§§ Methods and Control Structures
§§
Multiple-choice: ~15 questions
Free-response: 2 questions
§§ Methods and Control Structures
§§ Methods and Control Structures:
partial
Multiple-choice: ~25 questions
Free-response: 2 questions
§§ Class
§§ Class: partial

V.1 | 23
2019 College Board

00762-118-CED-CSA_Introduction.indd 23 4/13/19 12:08 PM

 ArrayList
UNIT UNIT UNIT
Array 2D Array
6 7 8
~6–8 Class
Periods 10–15% AP Exam
Weighting ~10–12 Class
Periods 2.5–7.5% AP Exam
Weighting ~10–12 Class
Periods 7.5–10% AP Exam
Weighting

VAR 6.1 Array Creation and VAR 7.1 Introduction to VAR 8.1 2D Arrays
1 Access 1 ArrayList 1
3 3 3

VAR 6.2 Traversing Arrays VAR 7.2 ArrayList Methods VAR 8.2 Traversing 2D Arrays
+
2 CON
3

VAR 6.3 Enhanced for Loop VAR 7.3 Traversing ArrayLists +

2
3 for Arrays
4 3

CON 6.4 Developing Algorithms CON 7.4 Developing Algorithms

3 Using ArrayLists
+ Using Arrays
4

CON 7.5 Searching

3
5

CON 7.6 Sorting

2

IOC 7.7 Ethical Issues Around

N/A
Data Collection

Personal Progress Check 6 Personal Progress Check 7 Personal Progress Check 8

Multiple-choice: ~15 questions
Free-response: 2 questions
§§ Array and ArrayList (Array only)
§§ Array and ArrayList (Array only):
partial
Multiple-choice: ~15 questions Multiple-choice: ~10 questions
Free-response: 1 question Free-response: 1 question
§§ Array and ArrayList §§ 2D Array
(ArrayList focus)

V.1 | 24
© 2019 College Board

00762-118-CED-CSA_Introduction.indd 24 4/13/19 12:08 PM

 UNIT UNIT
Inheritance Recursion
9 10
~13–15 Class
Periods 5–10% AP Exam
Weighting ~3–5 Class
Periods 5–7.5% AP Exam
Weighting

MOD 9.1 Creating Superclasses CON 10.1 Recursion

1 and Subclasses 1
3 5

MOD 9.2 Writing Constructors CON 10.2 Recursive Searching

3 for Subclasses 2 and Sorting
5

MOD 9.3 Overriding Methods

3
5

MOD 9.4 super Keyword

1
3

MOD 9.5 Creating References

3 Using Inheritance
5 Hierarchies
MOD
3
5

MOD
1
3

Personal Progress Check 9 Personal Progress Check 10

Multiple-choice: ~15 questions Multiple-choice: ~10 questions
Free-response: 2 questions Free-response: 1 question
§§ Class §§ Methods and Control Structures
§§ (recursive and non-recursive
solutions allowed)

V.1 | 25
2019 College Board

00762-118-CED-CSA_Introduction.indd 25 4/13/19 12:08 PM