You have four weeks until the AP CSP exam. This plan breaks the 5 Big Ideas into daily chunks, builds pseudocode fluency incrementally, and includes three full 70-question MCQ sets. Two to three focused hours per day.
Week 1: Big Ideas 1-2 Foundation
| Day | Topic | Review (60-90 min) | Practice (60-90 min) | Deliverable |
|---|---|---|---|---|
| Mon | Program Purpose & Design | What is a program's purpose vs function? Design thinking, requirements gathering | Classify 5 program descriptions by goal | Know purpose vs function |
| Tue | Debugging & Collaboration | Syntax vs logic errors, debugging strategies, iterative cycles | Fix 3 buggy pseudocode snippets | Trace and fix code |
| Wed | Binary & Bit Representation | 1 bit = 0 or 1. 1 byte = 8 bits. Decimal ↔ binary conversion | Convert 15 numbers: decimal ↔ binary | Master binary conversion |
| Thu | Compression: Lossy vs Lossless | JPEG (lossy) removes data. PNG (lossless) keeps all. Trade-off: file size vs quality | Answer 12 MCQ on compression methods | Know lossy vs lossless cold |
| Fri | Data Abstraction & Metadata | Metadata = data about data (file size, creation date, photo location) | 10 MCQ on metadata, abstraction | Understand metadata |
| Sat | Data Privacy & Security | PII = personally identifiable information. Encrypt. Control access. | 8 MCQ on PII, encryption basics | Know what PII is |
| Sun | Week 1 Review + Light Practice | Skim Big Ideas 1-2 summary | 15 mixed MCQ from Week 1 topics | Identify weak areas |
Week 2: Big Idea 3a — Lists & Procedures
| Day | Topic | Review (60-90 min) | Practice (60-90 min) | Deliverable |
|---|---|---|---|---|
| Mon | Variables & Assignment | Variables hold data. x ← 5 assigns. Types: numbers, strings, booleans | Trace 5 assignment sequences | Know assignment syntax |
| Tue | Lists (1-indexed) | list ← [1, 2, 3]. list[1] = 1. Lists are 1-indexed in AP Pseudocode | Create a list, predict values at indices | Master 1-indexing |
| Wed | List Operations | INSERT(list, i, val), APPEND(list, val), REMOVE(list, i), LENGTH(list) | Trace 8 list operations in sequence | Predict list state after operations |
| Thu | Procedures & Parameters | PROCEDURE name(p1, p2) { ... RETURN value }. Parameters = inputs. Return = output | Trace 5 procedures with parameters; predict return values | Know procedure structure |
| Fri | Scope & Abstraction | Variables inside a procedure are local (don't exist outside). Procedural abstraction = use a procedure without knowing internals | 10 MCQ on procedure scope, abstraction | Know local vs global |
| Sat | Full MCQ Practice Set 1 | Quick Big Ideas 1-2 review (30 min) | Timed 70-question MCQ (2 hrs) | Establish baseline score |
| Sun | Week 2 Review + Debrief | Analyze Set 1 weak spots. Re-study those Big Ideas. | 12 retake MCQ from Set 1 | Identify growth areas |
Week 3: Big Idea 3b — Control Flow & Algorithms
| Day | Topic | Review (60-90 min) | Practice (60-90 min) | Deliverable |
|---|---|---|---|---|
| Mon | IF/ELSE Conditionals | IF (condition) { ... } ELSE { ... }. Condition evaluates to true/false. Branching logic. | Trace 7 pseudocode blocks with nested IF/ELSE | Predict all branch outcomes |
| Tue | Loops: REPEAT n TIMES | REPEAT 3 TIMES { x ← x + 1 }. Fixed count. Best for known iterations. | Trace 5 REPEAT loops; track counter after each iteration | Master counter updates |
| Wed | Loops: REPEAT UNTIL | REPEAT UNTIL (x = 10) { x ← x + 1 }. Loop until condition is true. Best for unknown count. | Trace 6 REPEAT UNTIL blocks; identify loop termination | Know when loop stops |
| Thu | FOR EACH Loops | FOR EACH item IN list { DISPLAY(item) }. Iterate through list without index. Clean for list traversal. | Trace 5 FOR EACH loops; modify lists inside loops | Traverse lists flawlessly |
| Fri | Sequential, Parallel, Distributed Computing | Sequential = one task. Parallel = multiple tasks at once (faster, shared resources). Distributed = multiple machines. | 12 MCQ: identify which approach for a scenario | Know computing models |
| Sat | Undecidable Problems & Efficiency | Decidable = algorithm solves it. Undecidable = no algorithm for all inputs (halting problem). Efficiency: time complexity, scalability. | 10 MCQ on decidability, algorithm efficiency, bottlenecks | Know decidable vs undecidable |
| Sun | Week 3 Review + Full Trace Practice | Combine all Week 3 control structures. Trace one 20-line pseudocode block with multiple loops and conditionals. | 20 mixed MCQ from Week 3 | Trace complex code |
Week 4: Big Ideas 4-5 + Full Practice Exams
| Day | Topic | Review (60-90 min) | Practice (60-90 min) | Deliverable |
|---|---|---|---|---|
| Mon | Internet Architecture & Packets | Packet = data + header (source, destination, protocol). Router reads header, forwards. Protocols = agreed rules (TCP/IP, DNS, HTTP). | 12 MCQ on packets, routing, protocols | Know Internet basics |
| Tue | Redundancy & Scalability | Redundancy = multiple paths (fault tolerance). Scalability = handles growth. Bandwidth = capacity. Latency = delay. | 10 MCQ on redundancy, bottlenecks, system design | Know reliability concepts |
| Wed | Cybersecurity & Encryption | Symmetric: same key (fast). Asymmetric: public/private (slower, authentication). Phishing, malware, multi-factor auth. | 12 MCQ on encryption, security threats, defenses | Know security vocabulary |
| Thu | Digital Divide & Impact | Digital divide = access gaps. Beneficial computing innovations vs harmful. Bias in algorithms. Crowdsourcing, citizen science. IP, copyright. | 10 MCQ on computing impact, equity, ethics | Understand social impact |
| Fri | Full MCQ Practice Set 2 | Quick review of Big Ideas 4-5 (30 min) | Timed 70-question MCQ (2 hrs) | Measure progress |
| Sat | Review Weak Topics | Analyze Set 2 results. Reteach the bottom 3 Big Ideas. | 15 retake MCQ from lowest-scoring topics | Focus on growth |
| Sun | 6-Hour Mock Exam | Light skim of hardest concepts (30 min) | Full mock exam (3-4 hrs): 70 MCQ + break + 70 MCQ Set 3 + debrief. Track your score and confidence. | Final performance |
Create Performance Task Strategy
Throughout the month, review your own CPT submission:
- What does your program do? (purpose)
- What are the main data structures? (lists, variables)
- What are your biggest procedures?
- Any loops or conditionals you're proud of?
Some MCQ will show pseudocode similar to yours. Recognizing your own patterns = 2-4 free points.
Scoring targets
- 5: ~50-55+ on 70 MCQ (71-79%)
- 4: ~40-49 (57-70%)
- 3: ~28-39 (40-56%)
By the end of Week 4, aim for Set 3 score ≥ 50. If you're at 45, spend Day 7 reteaching pseudocode tracing (highest ROI).
Most common traps
- 1-indexed lists. AP Pseudocode:
list[1]= first item. - Loop counter off-by-one. Write state after each iteration.
- Lossy ≠ lossless. JPEG loses data (small file). PNG keeps all (large file).
- Symmetric = same key. Asymmetric = public/private.
- Parallel ≠ distributed. Parallel = shared machine, multiple cores. Distributed = multiple machines.
Resources
AP CSP topic library →. 3-Day plan → if you fall behind. Last-minute checklist → before exam day.
Good luck. One month, one topic per day, one day at a time. You've got this. 🎯