The AP Computer Science Principles exam has a vocabulary problem. Unlike AP Calculus, where you can reason through formulas you half-remember, AP CSP's multiple-choice section tests precise definitions under time pressure: 70 questions in 120 minutes. If you cannot instantly recall what a packet is, what lossless compression means, or why fault tolerance matters, you will lose points to hesitation. AP CSP flashcards fix that.

This guide gives you the complete AP CSP flashcards toolkit: 25 vetted AP CSP vocabulary terms organized by Big Idea, a card-building strategy derived directly from the official College Board AP Computer Science Principles exam page and its Curriculum & Exam Description (CED), a tool comparison table, and study timelines built around the spaced repetition schedule that the science consistently backs. By the end, you will have a concrete plan for every week between now and exam day. If your AP CSP class runs partly or fully online, our distance learning resources guide covers the async retention framework that keeps Big Idea vocabulary from leaking out between lessons.

AP CSP Exam Structure 70% Section I Multiple-Choice 70 questions 120 minutes 57 single-select 8 multi-select 5 reading passages 30% Section II Create Task 9 hrs in-class 2 written responses Direct vocabulary recall Program design language
AP CSP exam structure: MCQ section accounts for 70% of the final score; the Create Performance Task counts for the remaining 30%.

What You Need to Know About AP CSP Flashcards

Before building a single card, understand what you are actually preparing for. The 2026 AP Computer Science Principles exam has two components that demand different study strategies.

Component Weight Format Flashcard Priority
Section I: Multiple-Choice 70% 70 questions / 120 minutes High — direct vocabulary recall
Section II: Create Performance Task 30% 9 hours in-class + written response Medium — program design vocabulary

The MCQ section breaks down into three question types: 57 single-answer multiple-choice, 8 multiple-answer multiple-choice (where two or more options may be correct), and 5 reading-passage comprehension questions. Scoring is rights-only — no penalty for wrong answers, which means elimination strategies matter.

The Create Performance Task requires you to design, code, test, and reflect on an original computer program during 9 hours of in-class time. You submit a Personalized Project Reference (PPR) by April 30, 2026, then answer written-response questions about your code on exam day (May 14, 2026) using the Bluebook testing app. Most students who study consistently earn a passing score of 3 or above (College Board, AP CSP exam page).

The takeaway for flashcard strategy: vocabulary flashcards directly serve the 70% multiple-choice weight. A secondary deck focused on program design, testing, and ethics vocabulary supports the Create Task written response. Both are worth building.

The 5 Big Ideas of AP CSP: What to Flashcard

The 5 Big Ideas of AP CSP AP CSP Big Ideas CRD Creative Development DAT Data AAP ★ Algorithms & Programming Highest MCQ weight CSN Computing Systems & Networks IOC Impact of Computing 10% 20% 40% 20% 10% Approximate MCQ weight distribution across Big Ideas
The 5 Big Ideas of AP CSP. AAP (Algorithms & Programming) carries the most exam weight at roughly 40% of MCQ questions.

The College Board organizes all AP CSP content around five Big Ideas. Every vocabulary term, every exam question, and every Create Task prompt maps back to one or more of these. Build your flashcard deck using this same structure — it prevents gaps and gives you a mental filing system for exam day.

CRD — Creative Development
Designing and planning programs: program purpose, collaboration, program development lifecycle, program documentation, and iterative development. The Create Task lives here.
DAT — Data
How computers represent, store, compress, and extract meaning from data. Covers binary representation, compression types, metadata, data privacy, and the limitations of data analysis.
AAP — Algorithms and Programming
The largest Big Idea by exam weight. Control structures (sequence, selection, iteration), procedures, modularity, algorithm efficiency, lists and data structures, binary search, and the concept of undecidability.
CSN — Computing Systems and Networks
Hardware, operating systems, the internet's architecture, protocols (TCP/IP, HTTP, DNS), bandwidth, latency, cybersecurity threats, and encryption.
IOC — Impact of Computing
Social, cultural, and ethical implications: the digital divide, bias in algorithms, intellectual property, open-source software, legal/ethical concerns, and the environmental impact of computing.

AAP carries the most exam weight in the MCQ section, followed by DAT and CSN. CRD and IOC are lighter on raw term count but appear frequently in reading-passage questions that test reasoning rather than pure recall. Spread your card-building effort accordingly: roughly 40% AAP, 20% DAT, 20% CSN, 10% CRD, 10% IOC.

25 Essential AP CSP Vocabulary Terms

These 25 terms represent the core AP CSP vocabulary tested across both the MCQ section and the Create Task written response. Definitions are drawn from the official College Board Curriculum & Exam Description. Create one flashcard per term — front: the term; back: the definition plus one concrete example. This same list works as the backbone for any AP Computer Science Principles flashcards deck you build.

Algorithms & Programming (AAP)

  1. Algorithm — A step-by-step set of instructions designed to solve a problem or accomplish a task, expressed in natural language, pseudocode, or a programming language. Example: the process for sorting a deck of cards by rank.
  2. Procedure (Function/Method) — A named block of reusable code that performs a specific task and can be called multiple times throughout a program. Example: a calculateAverage() function that takes a list and returns the mean.
  3. Iteration — The repetition of part of an algorithm until a condition is met or for a specified number of times (loops). Example: a FOR loop that processes each item in a list.
  4. Sequence — The execution of statements in the order they appear in code. The most basic control structure; all programs have some sequence.
  5. Selection (Conditional) — A control structure that executes different code blocks based on whether a condition is true or false. Example: IF score ≥ 60 THEN display("Pass") ELSE display("Fail").
  6. Modularity — The separation of a program into independent modules, each responsible for one aspect of functionality. Enables collaboration, reuse, and easier debugging.
  7. Library / API — A collection of pre-built procedures (library) or a set of procedures with documented descriptions of how to call them (API). APIs allow programs to use capabilities without knowing the underlying implementation.

Data (DAT)

  1. Digital Data — Information represented in discrete values, typically binary (0s and 1s); the only form computers can directly process.
  2. Analog Data — Data with values that change smoothly and continuously over time (e.g., pitch, temperature); must be converted to digital before a computer can process it.
  3. Bit — A binary digit (0 or 1); the smallest unit of data on a computer. Eight bits form one byte.
  4. Data Compression — A method of reducing data size to save storage or transmission time; compression algorithms find representations using fewer bits. Comes in two forms: lossless and lossy.
  5. Lossless Compression — A compression technique that reduces bits while guaranteeing complete reconstruction of the original data. Example: ZIP file compression.
  6. Lossy Compression — A compression technique that reduces bits by permanently discarding some data; useful for images and audio where perception matters more than bit-for-bit precision. Example: JPEG images, MP3 audio.
  7. Data Abstraction — Hiding implementation details of data structures; users interact with a simplified representation without needing to understand the underlying mechanics.

Computing Systems & Networks (CSN)

  1. Bandwidth — The maximum amount of data that can be transmitted over a network connection in a given time, measured in bits per second (bps).
  2. Latency — The time delay for a data packet to travel from source to destination. High latency slows interactive applications even when bandwidth is large.
  3. Packet — A small unit of data sent over a network, containing a header (routing and destination information) and a payload (actual data). Large messages are split into multiple packets.
  4. Routing — The process of directing data packets across networks from sender to recipient. Routers examine packet headers to determine the best path.
  5. Cybersecurity — Protective measures — hardware, software, and practices — designed to prevent unauthorized access, theft, or damage to digital information and computing systems.
  6. Encryption — Converting plaintext into ciphertext using an algorithm and a key so that only authorized parties with the correct key can decrypt and read the data.
  7. Fault Tolerance — A system's ability to continue functioning correctly even when individual components fail. The internet's packet-switching design is inherently fault tolerant.

Creative Development & Impact (CRD + IOC)

  1. Abstraction — Reducing complexity by focusing on essential ideas and hiding irrelevant details; allows understanding and use of a system without full knowledge of its implementation. Fundamental to all computing.
  2. Heuristic — A problem-solving method that finds a satisfactory (not guaranteed optimal) solution in reasonable time, used when an exact algorithm would take too long.
  3. Undecidable Problem — A problem so complex that no algorithm can correctly answer "yes" or "no" for all possible inputs in all cases. Example: the Halting Problem.
  4. Bias in Computing — Systematic errors in algorithms or training data that produce results disproportionately affecting certain groups; often originates in biased input data or unexamined design assumptions.

These 25 terms are a floor, not a ceiling. Once you have these locked in via active recall, expand your deck by pulling additional terms from the official AP CSP reference sheet and each Big Idea section of the CED.

How to Build Your Own AP CSP Flashcard Deck

Most students build flashcard decks the wrong way: they copy full paragraphs from their notes, create hundreds of vague cards, and then wonder why review sessions feel unproductive. Here is a tighter process derived from the official CED.

Step 1: Source from the CED, Not Your Notes

The College Board publishes the AP CSP Curriculum & Exam Description as a free PDF at AP Central. This document lists every learning objective and every key term that can be tested. Build your vocabulary list from Appendix A of the CED, not from a classmate's Quizlet set. Third-party sets often contain imprecise definitions or terms that are not actually in scope.

Step 2: One Concept Per Card

The most common card-building mistake is cramming multiple ideas onto one card. "Explain lossless vs. lossy compression and give examples of each" is too much — that is two separate cards. Atomic cards produce cleaner recall signals, review faster, and let the algorithm schedule each concept independently based on how well you know it. See our flashcard study techniques guide for the full framework.

Step 3: Write the Back in Your Own Words

Do not copy the CED definition verbatim. Rephrase it in language that makes sense to you, then add one concrete example. This forces processing during card creation — which is itself a form of retrieval practice — and creates more memory pathways. A good AP CSP card back looks like this:

Lossless Compression
Shrinks file size without deleting any data — you get the exact original back when you decompress. Think ZIP files: the contents are identical after extraction.
Key contrast: lossy compression (JPEG, MP3) discards data permanently.

Step 4: Add the Big Idea Tag

Tag each card with its Big Idea abbreviation (AAP, DAT, CSN, CRD, IOC). Most flashcard apps support tags or deck folders. This lets you do targeted review when you are weak in one area, and it mirrors how the exam organizes questions.

Step 5: Review Before You Add More

Do not build 200 cards in one weekend and then wonder why you cannot keep up with reviews. Add 10–15 new cards per day, maximum. The spaced repetition algorithm will schedule review sessions — but only for cards already in the deck. Flooding the deck creates a backlog that breaks the schedule.

Anatomy of a Good AP CSP Flashcard Big Idea Tag: AAP FRONT — QUESTION What is a procedure in AP CSP pseudocode? BACK — ANSWER Named block of reusable code that performs one task; called multiple times throughout a program. Context: appears in 20+ released MCQs Big Idea tag Groups cards for targeted review by topic area Question front Precise, testable prompt — one concept only Answer back 1–2 sentence definition in your own words Context note Exam frequency or contrast with related term Each card = one concept, one Big Idea tag, one concrete answer
Anatomy of a well-structured AP CSP flashcard: precise question front, single-concept answer back, Big Idea tag, and a context note for exam frequency.

Best Flashcard Platforms for AP Computer Science Principles Flashcards

Platform choice matters less than consistency, but the right tool removes friction. Here is how the main options for AP CSP flashcards stack up. For a broader comparison across all use cases, see our complete best flashcard app guide.

Tool Price Spaced Repetition Browser-Based Best for AP CSP
Flashcard Maker Free FSRS (excellent) Yes — Chrome side panel Build deck while reading CED PDF or Fiveable; right-click to capture definitions
Anki Free (desktop); $24.99 iOS FSRS / SM-2 (excellent) No — desktop app required Long-term mastery; best if you plan to reuse your deck for CS coursework
Quizlet Free (limited) / $35.99/yr Limited (paid only) Yes Pre-made community sets exist; import via TSV into Flashcard Maker for better SRS
Knowt Free Basic Yes Good starting point for pre-made AP CSP sets; limited scheduling
Brainscape Free (limited) / $19.99/mo Confidence-based (good) Yes Mobile-friendly option if you review primarily on phone

Recommended workflow for most AP CSP students: Use Flashcard Maker as your primary tool. When reading the CED PDF or studying from Khan Academy or Fiveable in Chrome, highlight any definition you want to card, right-click, and create the flashcard without leaving the page. Study in the Chrome side panel using FSRS scheduling. If you already have a Quizlet set from a teacher or classmate, import it directly via TSV — no manual re-entry needed.

If you want to cross-reference Quizlet alternatives more broadly, that guide covers twelve platforms with honest tradeoffs.

Flashcard Maker: 3-Step Workflow AP CSP CED.pdf A packet is a unit of data Step 1 Highlight definition in CED PDF A packet is a unit of data Create flashcard Copy Search Google Print... Step 2 Right-click → Create flashcard Flashcard Maker QUESTION What is a packet? A small unit of data with header + payload Again Hard Good Easy Cards due: 12 · Streak: 7 days Step 3 Study in Chrome side panel with FSRS scheduling
Flashcard Maker workflow: highlight any definition on a webpage, right-click to create a flashcard, then study it in the Chrome side panel using FSRS spaced repetition — no tab-switching required.

Spaced Repetition for AP CSP: Your Study Timeline

The core insight behind spaced repetition is that reviewing a card just before you would forget it produces the greatest memory strengthening. Review too early and the effort is wasted. Review too late and you are re-learning, not reinforcing. The FSRS algorithm handles this scheduling automatically — but you need to start early enough for the intervals to matter.

Ebbinghaus Forgetting Curve vs. Spaced Repetition 100% 75% 50% 25% 0% Retention % Day 0 Day 1 Day 3 Day 7 Day 14 Day 30 Days Since Learning No review (decay) With spaced repetition (review points ●)
The Ebbinghaus forgetting curve (dashed) shows rapid decay without review. Spaced repetition (solid) reschedules each review just before forgetting, progressively reinforcing long-term retention to ~90% by day 30.

8-Week Plan (Ideal)

Starting 8 weeks before May 14 puts you around mid-March — early enough for the algorithm to run 4–5 full interval cycles before exam day.

  • Weeks 1–2: Build the 25 core vocabulary cards. Add 10 new cards per day. Focus: AAP terms (algorithms, procedures, control structures).
  • Weeks 3–4: Add DAT and CSN cards. Daily review of all scheduled cards (15–20 minutes). Do not skip days — the algorithm's intervals depend on consistency.
  • Weeks 5–6: Add CRD + IOC cards. Begin practice MCQ questions from AP Classroom. For any term you miss, create a new card immediately.
  • Weeks 7–8: Review-only phase. No new cards unless you find a gap. Complete at least one full practice exam. Tag difficult cards for extra review.
  • Exam week: Light review only — cards flagged as "Hard" or "Again" in FSRS. Do not cram new material. Sleep and consolidation matter more than last-minute additions.

4-Week Accelerated Plan

If you are starting a month out, compress the vocabulary phase and lean on pre-made content to skip the card-creation bottleneck.

  • Week 1: Import or build all 25 core vocabulary cards immediately. Add 20+ cards per day. Accept that early reviews will be tough.
  • Week 2: Add Create Task vocabulary (see section below). Daily review 20–25 minutes. Start one practice MCQ test by end of week.
  • Week 3: Review + targeted gap-filling. Complete two practice exams. Create cards for every term you missed.
  • Week 4: Review-only, with emphasis on "Hard" / "Again" rated cards. One final practice exam under timed conditions.

2-Week Emergency Plan

Two weeks is enough time to cover the highest-frequency terms if you study a study schedule built around the forgetting curve and prioritize ruthlessly.

  • Days 1–3: Build 25 core vocabulary cards. Focus exclusively on AAP and CSN — highest MCQ weight. Review twice daily.
  • Days 4–7: Add DAT and IOC cards. Daily review 30 minutes. Do one timed MCQ section.
  • Days 8–12: Review all scheduled cards + any terms from practice questions you missed.
  • Days 13–14: Timed practice exam, then light review of failed cards only.
8-Week AP CSP Study Timeline — Review Intensity 0 10 20 30 40 Cards/day W-8 W-7 W-6 W-5 W-4 W-3 W-2 W-1 Exam Weeks Before Exam Foundation ~10–12 new cards/day Active Recall ~25 reviews/day Final Sprint Weak cards Light review only 10 10 12 12 20 25 25 35 5
8-week AP CSP study timeline: gradually increasing review intensity from foundation building through the final sprint, with a light review-only session on exam day.

Common Mistakes Students Make with AP CSP Flashcards

1. Building Cards from Memory Instead of Source Documents

If you create a card based on what you think a term means, you may encode an imprecise or partially wrong definition. For AP CSP, the exam uses College Board definitions. Always verify against the CED or the official AP pseudocode reference before finalizing card content.

2. Copying Quizlet Sets Without Auditing Them

Community-created Quizlet sets for AP CSP are widely shared but uneven in quality. Some contain definitions that are technically correct but not how the College Board frames the concept on the exam. Others include terms from AP CS A (the Java-based programming course) that do not appear on AP CSP. Import existing sets as a starting point, then audit each card against the CED before trusting it.

3. Skipping the Create Task Vocabulary

Most students over-index on MCQ vocabulary and neglect the program design terms needed for the written response. Terms like abstraction, algorithm efficiency, and program purpose appear heavily in the Create Task prompts. Build a separate mini-deck for these.

4. Treating All Cards the Same

Not all terms are equally tested. AAP terms appear in the majority of MCQ questions. A card for algorithm deserves more early review than a card for a niche IOC concept. FSRS handles this automatically once you start rating cards accurately — but that means rating honestly. If you know a card, rate it "Good" or "Easy," not "Hard" out of anxiety. Inflated difficulty ratings cause the algorithm to waste review slots.

5. Stopping Reviews Three Days Before the Exam

The instinct to stop studying and "let it sink in" before an exam is understandable but counterproductive. Spaced repetition works by reviewing just before forgetting. Continue your scheduled reviews through the day before the exam. Just keep sessions short (15 minutes maximum) and avoid adding any new cards.

6. No Practice Under Exam Conditions

Flashcards build isolated recall. The AP CSP MCQ section requires applying vocabulary in context — reading a passage and identifying which term applies to a described scenario. Pair your flashcard review with timed AP Classroom practice questions starting at least four weeks before the exam. The two activities reinforce each other.

Sample Flashcard Examples

These seven example AP CSP flashcards demonstrate the format, depth, and contrast structure that produces strong recall on the exam. Use them as a template for your own AP CSP vocabulary deck.

Q: What is the difference between lossless and lossy compression?
A: Lossless compression reduces file size without losing any data — the original can be perfectly reconstructed (e.g., ZIP). Lossy compression permanently removes data to achieve greater size reduction (e.g., JPEG, MP3). Use lossy when perception matters more than precision; use lossless when exact data must be preserved.
Q: What is a packet, and why does it matter for internet communication?
A: A packet is a small unit of data containing a header (routing/destination info) and payload (actual data). Large messages are split into packets that travel independently across different network paths and are reassembled at the destination. This enables fault tolerance — if one path fails, packets reroute.
Q: An algorithm always produces the correct answer for every possible input. True or false?
A: False. An algorithm produces the correct output for the inputs it was designed to handle, but some problems (undecidable problems) have no algorithm that works for all possible inputs. Also, heuristic algorithms trade guaranteed correctness for speed.
Q: What is the difference between bandwidth and latency?
A: Bandwidth is the maximum data throughput (how much data can flow per second). Latency is the time delay for data to travel from source to destination. A connection can have high bandwidth but still feel slow if latency is high — common with satellite internet.
Q: Why is modularity important in program design?
A: Modularity breaks a program into independent components (procedures/functions), each handling one task. Benefits: (1) Easier debugging — isolate failures. (2) Reuse — call the same procedure multiple times. (3) Collaboration — multiple programmers can work on different modules simultaneously.
Q: What is abstraction in computing, and give two examples.
A: Abstraction hides complexity so users can work with simplified representations. Examples: (1) Calling a sort() function without knowing how sorting works internally. (2) Using an API to send an email without understanding network protocols. Abstraction is why programmers can build complex systems without knowing every detail.
Q: What is bias in computing, and how does it enter a system?
A: Bias is a systematic error that produces results disproportionately favoring or harming certain groups. It enters systems through: (1) Biased training data that over- or under-represents groups. (2) Design assumptions that embed the creator's perspective. (3) Feedback loops that amplify existing inequalities.

Create Performance Task Vocabulary

The Create Performance Task written response asks you to explain your program's purpose, describe its functionality, identify the algorithm you implemented, explain how you tested it, and reflect on its societal or ethical implications. These prompts require a different vocabulary from the MCQ section — less about recall, more about precise program design language.

Build a separate mini-deck (15–20 cards) covering these concepts. Here are the highest-priority terms with card-ready definitions:

Algorithm Design & Testing Cards

Program Purpose
The problem a program is designed to solve or the creative expression it enables. In the written response, state purpose in one clear sentence before describing how the program achieves it.
Algorithm Efficiency
A measure of how well an algorithm uses resources (time, memory) as the input size grows. Expressed informally as "reasonable time" (polynomial) vs. "unreasonable time" (exponential). AP CSP does not require Big-O notation — just the concept.
Testing (Program Testing)
The process of running a program with specific inputs to verify that its output matches the expected result. Identify at least two test cases in your written response: one typical input and one edge case.
Edge Case
An input at the boundary or limit of what a program is expected to handle (e.g., an empty list, a maximum value, a negative number). Edge case testing reveals bugs that typical inputs do not trigger.
Iteration (Refinement)
In the context of program development: the process of repeatedly improving a program based on testing results and user feedback. Distinct from iteration as a loop construct.
Debugging
The process of identifying and correcting errors (bugs) in a program. Types: syntax errors (code won't run), runtime errors (crash during execution), logic errors (wrong output without crashing). Logic errors are hardest to find.

Ethics & Impact Cards

Digital Divide
The gap between populations that have reliable access to computing and the internet and those that do not, often correlated with income, geography, and education.
Personally Identifiable Information (PII)
Any data that can be used to identify, contact, or locate an individual (name, address, SSN, biometrics). Collecting PII creates privacy obligations and security risks.
Intellectual Property
Legal protections for creative and inventive work: copyright (original works), patents (inventions), trademarks (brand identifiers). Open-source licenses allow others to use and modify code under defined conditions.
Crowdsourcing
Obtaining input, data, or work from a large, distributed group of people via the internet. Examples: Wikipedia, open-source software contributions, citizen science projects.

If you want support generating vocabulary drills or exploring AI study guide tools that can help you organize this material, that guide walks through eight platforms with honest tradeoffs. For automated card generation from study materials, our AI flashcard generator comparison covers the current options and their accuracy limits.

Tools & Resources to Get Started

Official College Board Resources

  • AP CSP Curriculum & Exam Description (CED): Free PDF from AP Central. Appendix A contains the complete vocabulary list. This is your primary source.
  • AP Classroom: Free practice questions, personal progress checks, and full practice exams. Requires school enrollment.
  • AP CSP Reference Sheet: Distributed on exam day. Contains the pseudocode syntax used in MCQ questions. Create flashcards for any pseudocode constructs that look unfamiliar.

Third-Party Study Resources

  • Khan Academy AP CSP: Free video lessons organized by Big Idea. Good for conceptual understanding; pair with flashcards for vocabulary.
  • Fiveable AP CSP: Structured study guides with key term definitions. Read these in Chrome with Flashcard Maker installed to capture terms in one click.
  • Code.org AP CSP: Many schools run this course; the Unit guides contain vocabulary lists organized by Big Idea.
  • APCSExamPrep.com: Paid flashcard bundles (200 cards organized by Big Idea). Useful as a reference check if you want to verify your own deck is complete.

Flashcard Tools

  • Flashcard Maker (Chrome extension): Free. Highlight any definition on any webpage — CED PDF, Khan Academy, Fiveable — and create the card with one right-click. Study in the Chrome side panel using FSRS. Import from Quizlet TSV. No account required; data stays in your browser.
  • Anki (desktop): Free. Best if you want to carry cards forward into college CS coursework. Steeper setup than Flashcard Maker.
  • Knowt: Free. Pre-made AP CSP sets exist; useful as a starting point to import and audit.

Final Checklist: Are You Ready for the AP CSP Exam?

Use this checklist in the final two weeks before May 14. A "yes" on each item means you have done the work that statistically correlates with a 3 or above.

  •  My AP CSP flashcards cover all 25 core vocabulary terms organized by Big Idea (AAP, DAT, CSN, CRD, IOC).
  •  I have a separate mini-deck covering Create Performance Task vocabulary (program purpose, testing, edge cases, debugging, ethics terms).
  •  I have reviewed all scheduled cards without skipping for at least two consecutive weeks.
  •  I have rated cards honestly (not marking "Easy" on terms I only vaguely remember).
  •  I have completed at least two timed MCQ practice sections from AP Classroom.
  •  For every MCQ term I missed in practice, I created a new flashcard immediately.
  •  I have submitted my Create Performance Task (PPR) by April 30.
  •  I can explain my Create Task program's purpose, algorithm, testing approach, and one ethical consideration in 2–3 sentences each, from memory.
  •  I know the AP pseudocode syntax for: sequence, selection (IF/ELSE), iteration (FOR/REPEAT), and procedure calls.
  •  My flashcard deck has fewer than 150 total cards (lean and focused beats bloated).

If you are checking off most items and still feel uncertain about the spaced repetition science, the deep dive on spaced repetition and 90% retention targets explains where that number comes from and how to calibrate your review workload for the exam date.

Frequently Asked Questions

How many questions are on the AP CSP exam?

The exam has 70 multiple-choice questions (Section I, 120 minutes) and 2 written-response questions about your Create Performance Task (Section II, approximately 90 minutes on exam day). The Create Task itself is completed during 9 hours of in-class time before the exam. In total: 70 MCQ + 2 written responses + the Create Task project itself.

What topics are covered on the AP CSP exam?

All exam content falls under the 5 Big Ideas: Creative Development (CRD), Data (DAT), Algorithms and Programming (AAP), Computing Systems and Networks (CSN), and Impact of Computing (IOC). AAP carries the highest MCQ weight, followed by DAT and CSN. Every term in the official CED vocabulary list is fair game. The AP pseudocode reference sheet (provided on exam day) defines the pseudocode syntax used in MCQ questions.

What is a good score on the AP CSP exam?

AP scores range from 1 to 5. A 3 or above is generally considered passing and may earn college credit depending on the institution. The majority of AP CSP test-takers earn a 3 or above, making it one of the higher-passing AP exams (see the official College Board exam page for the latest score distribution). A 4 or 5 demonstrates strong mastery and is more likely to satisfy credit requirements at selective universities.

Do you need to know coding for AP CSP?

Yes, but AP CSP is not a pure programming course. You need to write and debug a working program for the Create Performance Task (in any language your school supports). The MCQ section tests you on AP pseudocode — a simplified, language-neutral syntax defined in the reference sheet. You do not need to know syntax for any specific language on the MCQ section, but you must be able to read and trace pseudocode correctly.

What is the Create Performance Task in AP CSP?

The Create Performance Task is a through-course project where you independently design, code, test, and reflect on a program of your choice during 9 hours of in-class time. You submit a Personalized Project Reference (PPR) containing your program code by April 30, 2026. On exam day (May 14), you answer 2 written-response questions (4 distinct prompts) about your code using the Bluebook testing app. The Create Task counts for 30% of your final AP score.

Build your AP CSP deck from any study page

Read the CED PDF or Fiveable in Chrome, highlight any definition, right-click, and your flashcard is ready in under two seconds — no tab-switching, no typing. Study in the Chrome side panel with FSRS spaced repetition. Import from Quizlet TSV if you already have a set.

Install Flashcard Maker — Free