Expert-authored study guides covering the five Big Ideas of AP CSP — creative development, data, algorithms and programming, computer systems and networks, and the impact of computing — plus a complete Create Performance Task guide.
Section I MCQ (120 min): 70 questions — 57 single-select, 5 single-select with reading passage (computing innovation), and 8 multiple-select (choose 2 correct answers). No calculator. AP pseudocode reference sheet provided.
Section II Written Response (60 min): 4 prompts about your own Create Performance Task program — WR1, WR2(a), WR2(b), WR2(c). You bring your Personalized Project Reference (PPR); no other notes. Max 850 words total written response.
Submitted through AP Digital Portfolio approximately 2 weeks before exam day (2026 deadline: April 30). Approximately 9 in-class hours.
Deliverables: a complete program in any language (Python, JavaScript, Scratch, App Inventor, etc.) + a 60-second video showing input/functionality/output + a Personalized Project Reference (PPR) with two code segment screenshots. Scored on a 6-row rubric (6 points total).
Score Distributions (2025)
n = 175,174 · Mean: 2.87 · Only ~31% scored 4 or 5. The mean below 3 reflects the course's broad, heterogeneous population — AP CSP is designed to broaden CS participation, attracting many first-time CS students.
←), arithmetic, relational operators, Boolean (AND, OR, NOT) · Lists: INSERT, APPEND, REMOVE, LENGTH, 1-based indexing · Procedures with parameters; RETURN values · Sequential, selection (IF/ELSE), and iteration (REPEAT N TIMES, REPEAT UNTIL, FOR EACH) · Linear search vs. binary search (binary requires sorted list) · Algorithm efficiency: conceptual time comparison · Heuristics for intractable problems · Undecidable problems and the Halting Problem · Simulations and modelingEach row earns 0 or 1 point. The rows are graded independently — strong evidence in Row 5 does not compensate for missing evidence in Row 3. Every row must be satisfied on its own merits.
The pseudocode reference sheet is provided during MCQ. You must still be fluent with these constructs to work quickly under time pressure.
x ← 5 y ← x + 3 DISPLAY(y) → 8 a ← "hello" INPUT(name)
nums ← [3, 1, 4, 1, 5] APPEND(nums, 9) INSERT(nums, 2, 7) REMOVE(nums, 1) LENGTH(nums) → 5 nums[1] → first element
PROCEDURE add(a, b)
{
RETURN a + b
}
result ← add(3, 4)
DISPLAY(result) → 7
IF (condition)
{
<statements>
}
ELSE
{
<statements>
}
REPEAT 5 TIMES
{ <statements> }
REPEAT UNTIL (x = 0)
{ <statements> }
FOR EACH item IN list
{ <statements> }
More than a third of MCQ questions come from algorithms and programming. Master list operations, procedure tracing, and pseudocode reading. Know binary vs. linear search and when each applies.
These questions have objectively correct answers based on definitions — digital divide, bias in algorithms, privacy, copyright. Study the precise definitions (e.g., Creative Commons vs. copyright vs. open source).
Overflow error (number too large for bits allocated) vs. roundoff error (floating-point precision). Lossless (exact reconstruction) vs. lossy (reduced quality; cannot be undone). Know that metadata can reveal private information even without accessing the content.
The Internet's redundant paths enable fault tolerance — data can reroute when a node fails. HTTPS = HTTP + TLS encryption. Public-key encryption: the sender uses the recipient's public key to encrypt; only the recipient's private key can decrypt. Certificate authorities verify public key ownership.
Our worked solutions and practice questions are original instructional content created by Tian2 AP. They are aligned to the concepts and skills described in College Board’s Course and Exam Description and are not reproductions of, or affiliated with, College Board’s official materials.