You have seven days until the AP CSP exam. This plan spreads the material evenly, builds pseudocode fluency, and includes two full 70-question MCQ sets + one 6-hour mock exam. Four focused hours per day.
7-Day Study Schedule
| Day | Focus | Morning (2 hrs) | Afternoon (2 hrs) | Goal |
|---|---|---|---|---|
| 1 (Mon) | Big Idea 1: Creative Development | Review: program purpose, collaboration, debugging strategies | Practice: 5 MCQ on program design; trace 3 pseudocode snippets | Understand how programs are designed and debugged |
| 2 (Tue) | Big Idea 2: Data | Review: binary (decimal ↔ binary), lossy vs lossless, metadata | Practice: 10 MCQ on data representation, compression; convert 10 binary numbers | Master data fundamentals |
| 3 (Wed) | Big Idea 3a: Variables, Lists, Procedures | Review: assignment, list operations (INSERT, APPEND, REMOVE, LENGTH), procedure definition, parameters | Practice: trace 5 list-based procedures; 12 MCQ on list traversal and procedures | Know how to read procedure code cold |
| 4 (Thu) | Big Idea 3b: Control Flow, Algorithms | Review: IF/ELSE, loops (REPEAT n TIMES, REPEAT UNTIL, FOR EACH), sequential vs parallel, undecidable problems | Practice: trace 8 mixed-loop pseudocode blocks; 15 MCQ on conditionals, loops, algorithmic efficiency | Trace complex pseudocode without errors |
| 5 (Fri) | Big Idea 4: Networks & Internet | Review: packet switching, protocols, DNS, redundancy, scalability, fault tolerance, bandwidth | Practice: 15 MCQ on Internet architecture, routing, fault tolerance | Lock in network vocabulary |
| 6 (Sat) | Big Idea 5: Impact + Full MCQ Practice Set 1 | Review (1 hr): PII, encryption (symmetric/asymmetric), phishing, malware, bias, crowdsourcing | Timed full 70-question MCQ (2 hrs, no breaks) | Establish baseline score; identify weak topics |
| 7 (Sun) | Review weak topics + 6-Hour Mock Exam | Retake highest-error MCQ from Set 1; study those Big Ideas | Full 6-hour mock: 70 MCQ (2 hrs) + review (1 hr) + second timed 70 MCQ (2 hrs) + debrief | Simulate exam day; peak performance |
Day-by-Day Review Focus
Day 1: Creative Development
Know:
- Program purpose vs function (purpose = goal; function = what it does)
- Debugging: syntax vs logic errors
- Iterative design: plan → build → test → revise
- Collaboration tools, version control concepts
Practice: Read 3 program descriptions; classify what went wrong (design, test, collaboration?).
Day 2: Data
Know:
- Binary: 8-bit byte = 256 values (0–255). 1 bit = 0 or 1. 1 byte = 8 bits.
- Decimal 10 = binary 1010. Decimal 127 = binary 1111111.
- Lossy: JPEG, MP3 (removes data, smaller file, cannot recover original).
- Lossless: PNG, ZIP (preserves all data, larger file, fully reversible).
- Metadata: data about data (file size, creation date, location from photo).
Practice: Convert 5 decimal → binary and 5 binary → decimal. Answer 8 MCQ: which is lossy? How many bits to represent 500 values?
Day 3: Variables, Lists, Procedures
Know:
- Assignment:
x ← 5orname ← INPUT() - List (1-indexed):
list ← [10, 20, 30]thenlist[1]= 10,list[3]= 30 - Operations:
INSERT(list, 2, 100)→ inserts 100 at index 2;APPEND(list, 40)→ adds to end;REMOVE(list, 1)→ deletes index 1;LENGTH(list) - Procedure:
PROCEDURE sum(a, b) { RETURN a + b }takes parameters, returns value - Scope: procedure variables local to that procedure
Practice: Trace a 12-line pseudocode procedure that builds and modifies a list. Predict the final list state.
Day 4: Control Flow & Algorithms
Know:
IF (x > 5) { ... } ELSE { ... }— execution branches on conditionREPEAT 3 TIMES { ... }— fixed countREPEAT UNTIL (x = 10) { x ← x + 1 }— loop until conditionFOR EACH item IN list { DISPLAY(item) }— iterate through list- Sequential: one task after another. Parallel: multiple tasks at same time (faster, more complex).
- Undecidable: no algorithm solves it for all inputs (e.g., halting problem — can you prove a program terminates?).
Practice: Trace 8 pseudocode blocks with nested loops and conditionals. Identify 5 MCQ traps (e.g., loop condition off-by-one).
Day 5: Networks & Internet
Know:
- Packet: data chunk + header (source, destination). Router reads header, sends packet on best path.
- Protocol: agreed-upon format (TCP/IP, HTTP, DNS).
- Redundancy: multiple paths for data. If one path fails, data reroutes.
- Scalability: system handles growth (more users, more data).
- Fault tolerance: system continues operating even if part fails.
- Bandwidth: data capacity per unit time (Mbps).
- Latency: delay before data arrives.
Practice: 15 MCQ on packet routing, protocol layers, redundancy design, bottlenecks.
Day 6: Impact of Computing + Full MCQ Set 1
Review (1 hr):
- Digital divide: gap in access to computing (low-income, rural, elderly).
- PII: Personally Identifiable Information (name, SSN, email, location). Protect with encryption, access control.
- Encryption: Symmetric (same key for encode/decode, fast). Asymmetric (public key encode, private key decode, slower, for authentication).
- Phishing: fake email/website to steal credentials.
- Malware: software designed to harm (virus, worm, ransomware).
- Bias: algorithms trained on biased data produce biased outputs.
- Crowdsourcing: large group contributes (Wikipedia, Citizen Science).
- Intellectual property: copyright, patent, DMCA.
Practice (2 hrs): Timed 70-question full MCQ. No breaks. Time each section (about 45-50 min per section on real exam).
Day 7: Mock Exam + Final Weak-Topic Review
Morning (1 hr): Retake your bottom-5 MCQ from Set 1. Study the Big Ideas you scored lowest on.
Afternoon (3 hrs): Full 6-hour mock:
- 70-question MCQ (2 hrs, timed)
- 1-hour break + review your answers
- 70-question MCQ Set 2 (2 hrs, timed)
- Debrief: which topics repeat? Which MCQ styles tripped you up?
Scoring target
- 5: ~50-55+ on 70 MCQ (71-79%)
- 4: ~40-49 (57-70%)
- 3: ~28-39 (40-56%)
You need 50 correct to likely score a 5. Plan to spend extra time on Big Ideas 3-4 if you're short on time.
Common traps
- 1-indexed lists.
list[1]is the first item in AP Pseudocode. - Losing track of loop counter. Write down variable state after each iteration.
- Confusing lossy/lossless. JPEG is lossy; PNG is lossless.
- Symmetric vs asymmetric encryption. Same key = symmetric. Public/private = asymmetric.
- Parallel vs sequential. Parallel = faster but more complex. Sequential = one task at a time.
Ready to start?
Open the AP CSP topic library → and tackle Day 1 Monday morning. You've got a full week — use it wisely. 🎯