AP Computer Science Principles FRQ Guide 2026 — Create PT, Written Responses & Pseudocode
AP Computer Science Principles has one of the most unusual free response components of any AP exam: a major project (the Create Performance Task) submitted during the school year, plus written questions on the actual exam day. This guide covers both components with complete scoring rubrics, worked examples, and strategies to earn maximum points.
In This Guide
Exam Format & Scoring Overview
| Component | Format | Points | Weight | Timing |
|---|---|---|---|---|
| Section I | 70 multiple choice questions | 70 pts | 70% | 120 min (exam day) |
| Section II — Create PT | Program + written responses | 6 pts | 30%* | During school year |
*The Create PT contributes 30% of the AP score when scaled and combined with Section I MC.
No FRQs on exam day for 2026: As of the 2023 redesign, the AP CSP exam no longer includes written free response questions on exam day. All written responses are part of the Create Performance Task submitted weeks before the exam. The in-class exam is entirely multiple choice.
The Create Performance Task
The Create PT is a programming project you complete during the school year. You write a program of your choice (minimum 13 lines of code for the selected portion), record a short video demo (under 1 minute), and write written responses describing your program's functionality and development process.
Create PT Requirements
- Program: Any language (Python, JavaScript, Scratch, Java, etc.); must include a list/collection used to manage data and an algorithm with sequencing, selection, AND iteration
- Video: ≤1 minute, no narration, shows input, output, and a list being used; submitted as .mp4, .wmv, .avi, or .mov
- Written Response 3a: Describe what your program does and how the video illustrates its functionality
- Written Response 3b: Explain your list, what it stores, how it manages complexity, and a written algorithm in AP CSP pseudocode
- Written Response 3c: Identify and explain a procedure with a parameter, and trace through it step-by-step
- Written Response 3d: Describe your development process — testing, debugging, or collaboration
- Authenticity: Must be your own work. Collaboration is allowed on the program, but written responses must be entirely your own
Create PT Scoring Rubric (6 Points)
| Row | Criterion | Points | What Earns the Point |
|---|---|---|---|
| 1 | Program Purpose & Function | 1 | Response explains what the program does overall AND how the video illustrates this. Must name the purpose (not just the output). "My program allows users to track daily water intake by entering amounts and displaying a running total" earns the point. |
| 2 | Data Abstraction | 1 | Response names the list, describes what data it stores, and explains how it fulfills the program's purpose. The code segment showing the list must be included. A parallel code segment showing the list being accessed (e.g., in a loop) must also be shown. |
| 3 | Managing Complexity | 1 | Explain WHY the list is necessary — how it manages complexity. You must state what the program would have to do differently without the list (e.g., "Without the list, I would need to create a separate variable for each data point, making the program impossible to scale"). |
| 4 | Procedural Abstraction | 1 | Show a procedure (function) with at least one parameter. The code segment must be included. Response must name the parameter and explain how it affects the procedure's behavior. Show where the procedure is called with a specific argument. |
| 5 | Algorithm Implementation | 1 | The procedure in row 4 must contain sequencing, selection (IF/ELSE), AND iteration. Show a written algorithm in AP pseudocode describing how the procedure works. The algorithm must match the actual code in the program. |
| 6 | Testing | 1 | Describe two different test cases: what input was used, expected output, actual output, and what each test proves. The two calls must use different argument values that test different behavior (not just the same function called twice with similar inputs). |
The most missed row is Row 3 (Managing Complexity). Many students write only "the list makes the program easier" — this earns 0 points. You must explain specifically what the program could NOT do the same way without the list. Compare a list-based approach to what would be required with individual variables.
Written Response Questions on Exam Day
The exam day section is entirely multiple choice (70 questions, 120 minutes). However, several MC questions present code in AP pseudocode and ask you to trace through it or identify its purpose. These function like written response problems in that you must work through logic step by step.
Types of Code Tracing Questions
- Trace a loop: Pseudocode gives a REPEAT UNTIL or FOR EACH loop; you determine the output or final value
- Identify a bug: Code is almost correct; find the one statement that causes wrong behavior
- Select an algorithm: Multiple pseudocode algorithms shown; pick the one that produces a given output
- Evaluate a boolean expression: Track what NOT, AND, OR do to nested conditions
- List operations: Trace INSERT, APPEND, REMOVE, or access via index; remember lists are 1-indexed in AP CSP
Pseudocode Question Strategy
AP CSP uses its own pseudocode notation that differs from Python, Java, or any real language. You must memorize the notation:
| Operation | AP CSP Notation | Notes |
|---|---|---|
| Assignment | x ← 5 | Arrow, not = or := |
| Output | DISPLAY(x) | Shows value on screen |
| If / else | IF (cond) { } ELSE { } | Curly braces for blocks |
| Count-controlled loop | REPEAT n TIMES { } | Runs exactly n times |
| Condition loop | REPEAT UNTIL (cond) { } | Runs until condition is TRUE |
| For each | FOR EACH item IN list { } | Iterates over every element |
| Modulo | x MOD y | Remainder of x ÷ y |
| List access | list[i] | 1-indexed! list[1] is first element |
| List length | LENGTH(list) | Returns number of elements |
| Append | APPEND(list, value) | Adds to the end of the list |
| Insert | INSERT(list, i, value) | Inserts at position i, shifting others right |
| Remove | REMOVE(list, i) | Removes element at position i |
1-indexed lists are the #1 trap. In AP CSP pseudocode,
list[1] is the first element — not list[0] as in Python or Java. A loop that runs from 1 to LENGTH(list) covers every element. A loop from 0 to LENGTH(list)-1 would be wrong in AP CSP pseudocode.
Worked Example — Trace a Loop with a List
Question: What does the following procedure return when called as mystery([3, 1, 4, 1, 5])?
PROCEDURE mystery(nums)
{
result ← 0
FOR EACH n IN nums
{
IF (n MOD 2 = 0)
{
result ← result + n
}
}
RETURN result
}Step-by-step trace:
| n | n MOD 2 = 0? | result after step |
|---|---|---|
| 3 | 3 MOD 2 = 1 → NO | 0 |
| 1 | 1 MOD 2 = 1 → NO | 0 |
| 4 | 4 MOD 2 = 0 → YES | 0 + 4 = 4 |
| 1 | 1 MOD 2 = 1 → NO | 4 |
| 5 | 5 MOD 2 = 1 → NO | 4 |
Answer: The procedure returns 4 (the sum of all even numbers in the list).
5 Most Common AP CSP FRQ & Create PT Mistakes
1. Not explaining WHY the list manages complexity
Row 3 requires you to state what the code would have to do WITHOUT the list. Just saying "the list makes the program more efficient" earns 0. Say: "Without the list, I would need 30 separate variables to store 30 student scores, and the loop could not process them dynamically."
Row 3 requires you to state what the code would have to do WITHOUT the list. Just saying "the list makes the program more efficient" earns 0. Say: "Without the list, I would need 30 separate variables to store 30 student scores, and the loop could not process them dynamically."
2. Procedure missing sequencing, selection, OR iteration
Row 5 requires your selected procedure to have all three: sequential statements, an IF/ELSE, and a loop. If your procedure only has a loop and sequential code but no conditional, it fails the criterion. Design your procedure deliberately to include all three.
Row 5 requires your selected procedure to have all three: sequential statements, an IF/ELSE, and a loop. If your procedure only has a loop and sequential code but no conditional, it fails the criterion. Design your procedure deliberately to include all three.
3. Two test cases testing the same behavior
Row 6 requires two different test cases that test different aspects of the program. Calling the same function twice with slightly different numbers doesn't count. One test case should explore the "happy path" (normal input); the other should test an edge case or different branch of your conditional.
Row 6 requires two different test cases that test different aspects of the program. Calling the same function twice with slightly different numbers doesn't count. One test case should explore the "happy path" (normal input); the other should test an edge case or different branch of your conditional.
4. Using 0-indexed list access in AP pseudocode
AP CSP pseudocode uses 1-based indexing. If you're tracing a loop and confuse
AP CSP pseudocode uses 1-based indexing. If you're tracing a loop and confuse
list[1] = first element with Python-style list[0], you'll get the wrong answer on multiple choice tracing questions.
5. Describing output instead of program purpose
Row 1 asks for the program's purpose — WHY it was made and what problem it solves — not just what it outputs. "My program displays numbers" is output description. "My program helps students track their study time per subject to identify where to focus revision" is purpose.
Row 1 asks for the program's purpose — WHY it was made and what problem it solves — not just what it outputs. "My program displays numbers" is output description. "My program helps students track their study time per subject to identify where to focus revision" is purpose.
Related Resources
- AP Computer Science Principles Score Calculator
- AP Computer Science Principles Score Curve 2026
- AP Computer Science Principles Practice Test -- 30 Questions