Description
Both AP Computer Science study packets in one discounted bundle — AP Computer Science A (Java programming) and AP Computer Science Principles (concepts, algorithms, internet, and impact). Together they cover every topic on both exams: all 10 CSA units with formatted Java code blocks, all 5 CSP Big Ideas, both Create Performance Task guides, all FRQ types, and 200 AP-format practice questions with complete answer keys. Two complete packets. One bundle price.
⭐ WHAT'S INCLUDED
This bundle contains two separate, complete study packets delivered as two PDF files:
📘 PACKET 1: AP COMPUTER SCIENCE A EXAM STUDY PACKET
The AP CSA exam is 3 hours — 40 MC questions (90 minutes, 50%) and 4 FRQ questions (90 minutes, 50%). Everything on the exam is Java code: the MC asks you to trace code and determine output; the FRQ asks you to write Java code from scratch. All 10 units are covered with formatted code blocks throughout using monospace font.
UNIT 1: PRIMITIVE TYPES — int, double, boolean; integer division (the most commonly tested trap: 7/2 = 3); modulo operator and its applications (check even/odd, extract last digit); casting (truncation vs. widening); compound operators; integer overflow; String concatenation with + and left-to-right evaluation.
UNIT 2: USING OBJECTS — Complete String methods reference: length(), substring(a,b) (exclusive end index — heavily tested), substring(a), indexOf(), equals() (NEVER use == for String comparison — the single most tested String trap), compareTo(), toUpperCase(), toLowerCase(). All Math class methods with examples: Math.abs(), Math.pow(), Math.sqrt(), Math.random() (returns double in [0.0, 1.0)). Random integer patterns fully worked out: (int)(Math.random() * n) + 1 for 1 to n, formula for any range.
UNIT 3: BOOLEAN EXPRESSIONS AND IF STATEMENTS — All comparison operators. Logical operators (&& and || and !) with short-circuit evaluation explained. De Morgan's Laws with three worked examples — one of the most heavily tested topics on AP CSA MC. Nested if/else tracing. Dangling else. If/else if/else chains.
UNIT 4: ITERATION — For loops (count up, count down, step by value). While loops. Do-while loops. Off-by-one errors. Nested loops with full step-by-step iteration counting (including examples where the inner loop depends on the outer variable). String traversal patterns: count vowels, reverse a string, character-by-character processing. Loop tracing practice.
UNIT 5: WRITING CLASSES — Complete anatomy of a Java class with a full BankAccount example: private instance variables (encapsulation), constructor with this. keyword, accessor (getter) methods, mutator (setter) methods, toString() method, static variables, static methods. Access modifiers (private vs. public). The this keyword explained. Static vs. instance distinction. What toString() must return.
UNIT 6: ARRAY — Fixed size (cannot add or remove). Zero-based indexing. ArrayIndexOutOfBoundsException. Declaration and initialization (new int[5] vs. {3,1,4,1,5}). arr.length (field, not method). Standard vs. enhanced for loop (for-each cannot modify elements). Complete array algorithms: sum, find maximum, find minimum, count elements meeting condition, check if all elements meet condition.
UNIT 7: ARRAYLIST — Dynamic size. Objects only (Integer not int). Complete methods reference: add(), add(i,obj), get(), set(), remove(), size(), contains(). Array vs. ArrayList comparison table. The critical backwards-traversal pattern for removing while iterating — why traversing forward causes elements to be skipped (with full explanation and code example).
UNIT 8: 2D ARRAY — Array of arrays. arr[row][col] — row first, column second (directly tested). arr.length = rows, arr[0].length = columns. Declaration and initialization. Row-major traversal (nested loops). Enhanced for loop version. Sum all elements, find row with maximum sum. Column-major traversal.
UNIT 9: INHERITANCE AND POLYMORPHISM — extends keyword. super() must be the first line in a subclass constructor. super.method() to call the superclass version. @Override annotation. Method overriding vs. method overloading. Polymorphism: declared type determines what methods are callable; actual type determines which version runs (dynamic dispatch). Animal a = new Dog() — full trace of which method runs. instanceof for type checking before casting. Abstract classes.
UNIT 10: RECURSION — Base case and recursive case. StackOverflowError without a base case. Factorial traced completely through all calls. Fibonacci. Mystery recursion traced step by step. Linear search O(n) — works on any array. Binary search O(log n) — REQUIRES sorted array — complete implementation. Selection sort O(n²) — find minimum, swap to front. Insertion sort O(n²). Time complexity comparison.
FRQ STRATEGY GUIDE for all 4 question types: Methods and Control Structures (read all provided code first, use helper methods), Classes (checklist: private variables, constructor, correct return types, toString), Arrays/ArrayLists (count/sum/filter patterns, backwards removal), 2D Arrays (row vs. column confusion, bounds checking). Partial credit strategy: never leave blank, write what you know, use comments.
100-question practice test + complete answer key with step-by-step explanations for every question.
Java Quick Reference: critical code patterns (swap, find max, palindrome, backwards ArrayList removal, 2D array sum). String methods table. ArrayList methods table.
📗 PACKET 2: AP COMPUTER SCIENCE PRINCIPLES EXAM STUDY PACKET
The AP CSP exam is digital — 70 MC questions (120 minutes, 70%) and a Create Performance Task (30%). The MC tests all 5 Big Ideas; no specific programming language is required. The Create PT requires building a program, recording a 60-second video, and writing responses to four prompts.
BIG IDEA 1: CREATIVE DEVELOPMENT (~10-13%) — Collaboration benefits. Iterative design process. Program documentation (comments do not affect execution). Testing strategies: test cases, edge cases, random testing. Types of errors: syntax, runtime, logic. Abstraction: hiding complexity behind a simpler interface. Top-down and bottom-up design. Modular programming.
BIG IDEA 2: DATA (~17-22%) — Binary and data representation: all digital data is ultimately 1s and 0s. The n-bits rule: 2^n values. Binary-to-decimal and decimal-to-binary conversion with fully worked examples (1010 = 10; 13 = 1101). Integer overflow. Hexadecimal (base 16): each digit = 4 bits, used for color codes and memory addresses. ASCII vs. Unicode (7-bit English only vs. 21-bit all world scripts). Images: pixels, RGB, 3 bytes per pixel. Sound: sampling rate, 44,100 Hz = CD quality. Lossless vs. lossy compression: ZIP/PNG vs. JPEG/MP3/MP4, when to use each, irreversibility of lossy. Metadata: data about data, GPS in photos, privacy implications. The aggregation problem: combining individually harmless data reveals private information. PII (Personally Identifiable Information). Third-party data sharing. Algorithmic bias: non-representative training data, facial recognition accuracy disparities, hiring algorithms, feedback loops.
BIG IDEA 3: ALGORITHMS AND PROGRAMMING (~30-35%) — Complete AP CSP pseudocode reference in two formatted blocks: variables and assignment (x ← 5), arithmetic operators including MOD (17 MOD 5 = 2), boolean and comparison operators, DISPLAY and INPUT, IF/ELSE conditionals, REPEAT n TIMES (exactly n times), REPEAT UNTIL (runs while FALSE, stops when TRUE — the opposite of most while loops and a frequently tested distinction), FOR EACH item IN list, procedures with RETURN, and lists. CRITICAL: AP CSP pseudocode uses 1-based indexing — myList[1] is the first element, directly tested and different from Python/Java/JavaScript. Full loop tracing examples with every variable value shown. Procedures and parameters (local scope, parameters don't affect outside variables). The three algorithmic building blocks: sequencing, selection, iteration. Algorithm efficiency: O(1) constant, O(log n) logarithmic, O(n) linear, O(n²) quadratic, O(2^n) exponential — each with plain-English explanation and practical impact. Reasonable vs. unreasonable algorithms. Undecidable problems and the Halting Problem (Turing, 1936). Heuristics.
BIG IDEA 4: COMPUTING SYSTEMS AND NETWORKS (~11-15%) — Packet switching: data broken into independently routed packets, reassembled at destination, fault-tolerant design. Key protocols: IP (addressing), IPv4 (32-bit, ~4 billion addresses) vs. IPv6 (128-bit, developed because IPv4 was being exhausted), TCP (reliable delivery, acknowledgment, retransmission) vs. UDP (faster, no guarantee, for streaming), DNS (domain names to IP addresses), HTTP vs. HTTPS (TLS/SSL encryption and certificate verification). Bandwidth (capacity per second) vs. latency (time delay). Encryption: symmetric (same key encrypts and decrypts, AES) vs. asymmetric/public-key (public key encrypts, private key decrypts, RSA), how HTTPS combines both. Cybersecurity threats and defenses: phishing, malware types (virus, worm, ransomware, spyware, trojan), DDoS attacks, SQL injection, two-factor authentication (2FA), Certificate Authorities, firewalls. Redundancy and fault tolerance. Parallel computing (independent parts run simultaneously — not all problems can be parallelized). Cloud computing.
BIG IDEA 5: IMPACT OF COMPUTING (~27-32%) — Benefits and harms table for six technologies: social media, automation/AI, GPS/location, medical computing, e-commerce, open source software — same technology producing simultaneous intended and unintended consequences. Digital divide: geography, income, age, disability. Accessibility in design: screen readers, captions, color contrast. Copyright (automatic, life + 70 years), Creative Commons licenses (CC-BY, CC-BY-NC, share alike), fair use (four-factor test, no automatic exceptions), open source (GPL vs. MIT). Plagiarism vs. copyright infringement (academic vs. legal). Algorithmic bias and feedback loops. Crowdsourcing. AI and automation's employment effects. Privacy: PII, HIPAA, FERPA, GDPR (right to be forgotten), third-party data sharing.
CREATE PERFORMANCE TASK (CPT) GUIDE — complete: Program requirements (input, output, list, procedure with parameter that affects functionality, procedure must include sequencing + selection + iteration). Video requirements (60 seconds max, must show input/output and list in use). Written response guidance for all four prompts: Prompt 3a (program PURPOSE — what it does and who it serves, not how it works), Prompt 3b (data abstraction — what the list stores, code showing data stored IN and retrieved FROM the list, why a list manages complexity), Prompt 3c (algorithmic abstraction — procedure with all three building blocks, how it works, why the program would be different without it), Prompt 3d (testing — two different test cases with different inputs, expected outputs, and what each test checks). Common error for each prompt. Video requirements.
100-question practice test + complete answer key with full explanations.
Quick Reference: powers of 2 table (2^1 through 2^30), AP CSP pseudocode summary, algorithm efficiency comparison table.
⭐ WHO THIS BUNDLE IS PERFECT FOR
- Students taking both AP Computer Science A and AP Computer Science Principles — the two courses are offered at many schools and students who take both benefit from having both review resources
- Students deciding between AP CSA and AP CSP who want to understand both exams before choosing
- Teachers who teach both courses and want comprehensive review materials for each
- Students taking AP CSP as a prerequisite or companion to AP CSA who want to see how the conceptual Big Ideas connect to actual Java programming
- Homeschool families whose students are completing one or both courses
- Tutors who work with students in both courses and need a single purchase covering both exams
- Anyone who wants to compare the two courses side by side — AP CSA is a deep dive into Java programming; AP CSP is a broader conceptual survey of computing and its impact
⭐ WHY THESE TWO PACKETS COMPLEMENT EACH OTHER
AP CSA and AP CSP test related but distinct aspects of computing. AP CSA goes deep on one language and one skill — writing Java code. AP CSP goes broad across five Big Ideas — algorithms and programming are only one of them, alongside data, networking, cybersecurity, and societal impact. A student who has studied both will recognize concepts that connect: algorithm efficiency (Big-O) is covered in both; the concept of abstraction appears in both (procedures in CSP, classes and inheritance in CSA); data representation appears in CSP while data structures appear in CSA. Studying both together builds a more complete understanding of the field.
⭐ ALIGNMENT
AP Computer Science A packet: aligned to the College Board AP CSA Course and Exam Description, all 10 units, all 4 FRQ types, Java AP subset. AP Computer Science Principles packet: aligned to the College Board AP CSP Course and Exam Description, all 5 Big Ideas, Create Performance Task requirements, AP pseudocode reference.
AP Computer Science Bundle | Computer Science A + Computer Science Principles
Highlights
Save even more with bundles
Description
Both AP Computer Science study packets in one discounted bundle — AP Computer Science A (Java programming) and AP Computer Science Principles (concepts, algorithms, internet, and impact). Together they cover every topic on both exams: all 10 CSA units with formatted Java code blocks, all 5 CSP Big Ideas, both Create Performance Task guides, all FRQ types, and 200 AP-format practice questions with complete answer keys. Two complete packets. One bundle price.
⭐ WHAT'S INCLUDED
This bundle contains two separate, complete study packets delivered as two PDF files:
📘 PACKET 1: AP COMPUTER SCIENCE A EXAM STUDY PACKET
The AP CSA exam is 3 hours — 40 MC questions (90 minutes, 50%) and 4 FRQ questions (90 minutes, 50%). Everything on the exam is Java code: the MC asks you to trace code and determine output; the FRQ asks you to write Java code from scratch. All 10 units are covered with formatted code blocks throughout using monospace font.
UNIT 1: PRIMITIVE TYPES — int, double, boolean; integer division (the most commonly tested trap: 7/2 = 3); modulo operator and its applications (check even/odd, extract last digit); casting (truncation vs. widening); compound operators; integer overflow; String concatenation with + and left-to-right evaluation.
UNIT 2: USING OBJECTS — Complete String methods reference: length(), substring(a,b) (exclusive end index — heavily tested), substring(a), indexOf(), equals() (NEVER use == for String comparison — the single most tested String trap), compareTo(), toUpperCase(), toLowerCase(). All Math class methods with examples: Math.abs(), Math.pow(), Math.sqrt(), Math.random() (returns double in [0.0, 1.0)). Random integer patterns fully worked out: (int)(Math.random() * n) + 1 for 1 to n, formula for any range.
UNIT 3: BOOLEAN EXPRESSIONS AND IF STATEMENTS — All comparison operators. Logical operators (&& and || and !) with short-circuit evaluation explained. De Morgan's Laws with three worked examples — one of the most heavily tested topics on AP CSA MC. Nested if/else tracing. Dangling else. If/else if/else chains.
UNIT 4: ITERATION — For loops (count up, count down, step by value). While loops. Do-while loops. Off-by-one errors. Nested loops with full step-by-step iteration counting (including examples where the inner loop depends on the outer variable). String traversal patterns: count vowels, reverse a string, character-by-character processing. Loop tracing practice.
UNIT 5: WRITING CLASSES — Complete anatomy of a Java class with a full BankAccount example: private instance variables (encapsulation), constructor with this. keyword, accessor (getter) methods, mutator (setter) methods, toString() method, static variables, static methods. Access modifiers (private vs. public). The this keyword explained. Static vs. instance distinction. What toString() must return.
UNIT 6: ARRAY — Fixed size (cannot add or remove). Zero-based indexing. ArrayIndexOutOfBoundsException. Declaration and initialization (new int[5] vs. {3,1,4,1,5}). arr.length (field, not method). Standard vs. enhanced for loop (for-each cannot modify elements). Complete array algorithms: sum, find maximum, find minimum, count elements meeting condition, check if all elements meet condition.
UNIT 7: ARRAYLIST — Dynamic size. Objects only (Integer not int). Complete methods reference: add(), add(i,obj), get(), set(), remove(), size(), contains(). Array vs. ArrayList comparison table. The critical backwards-traversal pattern for removing while iterating — why traversing forward causes elements to be skipped (with full explanation and code example).
UNIT 8: 2D ARRAY — Array of arrays. arr[row][col] — row first, column second (directly tested). arr.length = rows, arr[0].length = columns. Declaration and initialization. Row-major traversal (nested loops). Enhanced for loop version. Sum all elements, find row with maximum sum. Column-major traversal.
UNIT 9: INHERITANCE AND POLYMORPHISM — extends keyword. super() must be the first line in a subclass constructor. super.method() to call the superclass version. @Override annotation. Method overriding vs. method overloading. Polymorphism: declared type determines what methods are callable; actual type determines which version runs (dynamic dispatch). Animal a = new Dog() — full trace of which method runs. instanceof for type checking before casting. Abstract classes.
UNIT 10: RECURSION — Base case and recursive case. StackOverflowError without a base case. Factorial traced completely through all calls. Fibonacci. Mystery recursion traced step by step. Linear search O(n) — works on any array. Binary search O(log n) — REQUIRES sorted array — complete implementation. Selection sort O(n²) — find minimum, swap to front. Insertion sort O(n²). Time complexity comparison.
FRQ STRATEGY GUIDE for all 4 question types: Methods and Control Structures (read all provided code first, use helper methods), Classes (checklist: private variables, constructor, correct return types, toString), Arrays/ArrayLists (count/sum/filter patterns, backwards removal), 2D Arrays (row vs. column confusion, bounds checking). Partial credit strategy: never leave blank, write what you know, use comments.
100-question practice test + complete answer key with step-by-step explanations for every question.
Java Quick Reference: critical code patterns (swap, find max, palindrome, backwards ArrayList removal, 2D array sum). String methods table. ArrayList methods table.
📗 PACKET 2: AP COMPUTER SCIENCE PRINCIPLES EXAM STUDY PACKET
The AP CSP exam is digital — 70 MC questions (120 minutes, 70%) and a Create Performance Task (30%). The MC tests all 5 Big Ideas; no specific programming language is required. The Create PT requires building a program, recording a 60-second video, and writing responses to four prompts.
BIG IDEA 1: CREATIVE DEVELOPMENT (~10-13%) — Collaboration benefits. Iterative design process. Program documentation (comments do not affect execution). Testing strategies: test cases, edge cases, random testing. Types of errors: syntax, runtime, logic. Abstraction: hiding complexity behind a simpler interface. Top-down and bottom-up design. Modular programming.
BIG IDEA 2: DATA (~17-22%) — Binary and data representation: all digital data is ultimately 1s and 0s. The n-bits rule: 2^n values. Binary-to-decimal and decimal-to-binary conversion with fully worked examples (1010 = 10; 13 = 1101). Integer overflow. Hexadecimal (base 16): each digit = 4 bits, used for color codes and memory addresses. ASCII vs. Unicode (7-bit English only vs. 21-bit all world scripts). Images: pixels, RGB, 3 bytes per pixel. Sound: sampling rate, 44,100 Hz = CD quality. Lossless vs. lossy compression: ZIP/PNG vs. JPEG/MP3/MP4, when to use each, irreversibility of lossy. Metadata: data about data, GPS in photos, privacy implications. The aggregation problem: combining individually harmless data reveals private information. PII (Personally Identifiable Information). Third-party data sharing. Algorithmic bias: non-representative training data, facial recognition accuracy disparities, hiring algorithms, feedback loops.
BIG IDEA 3: ALGORITHMS AND PROGRAMMING (~30-35%) — Complete AP CSP pseudocode reference in two formatted blocks: variables and assignment (x ← 5), arithmetic operators including MOD (17 MOD 5 = 2), boolean and comparison operators, DISPLAY and INPUT, IF/ELSE conditionals, REPEAT n TIMES (exactly n times), REPEAT UNTIL (runs while FALSE, stops when TRUE — the opposite of most while loops and a frequently tested distinction), FOR EACH item IN list, procedures with RETURN, and lists. CRITICAL: AP CSP pseudocode uses 1-based indexing — myList[1] is the first element, directly tested and different from Python/Java/JavaScript. Full loop tracing examples with every variable value shown. Procedures and parameters (local scope, parameters don't affect outside variables). The three algorithmic building blocks: sequencing, selection, iteration. Algorithm efficiency: O(1) constant, O(log n) logarithmic, O(n) linear, O(n²) quadratic, O(2^n) exponential — each with plain-English explanation and practical impact. Reasonable vs. unreasonable algorithms. Undecidable problems and the Halting Problem (Turing, 1936). Heuristics.
BIG IDEA 4: COMPUTING SYSTEMS AND NETWORKS (~11-15%) — Packet switching: data broken into independently routed packets, reassembled at destination, fault-tolerant design. Key protocols: IP (addressing), IPv4 (32-bit, ~4 billion addresses) vs. IPv6 (128-bit, developed because IPv4 was being exhausted), TCP (reliable delivery, acknowledgment, retransmission) vs. UDP (faster, no guarantee, for streaming), DNS (domain names to IP addresses), HTTP vs. HTTPS (TLS/SSL encryption and certificate verification). Bandwidth (capacity per second) vs. latency (time delay). Encryption: symmetric (same key encrypts and decrypts, AES) vs. asymmetric/public-key (public key encrypts, private key decrypts, RSA), how HTTPS combines both. Cybersecurity threats and defenses: phishing, malware types (virus, worm, ransomware, spyware, trojan), DDoS attacks, SQL injection, two-factor authentication (2FA), Certificate Authorities, firewalls. Redundancy and fault tolerance. Parallel computing (independent parts run simultaneously — not all problems can be parallelized). Cloud computing.
BIG IDEA 5: IMPACT OF COMPUTING (~27-32%) — Benefits and harms table for six technologies: social media, automation/AI, GPS/location, medical computing, e-commerce, open source software — same technology producing simultaneous intended and unintended consequences. Digital divide: geography, income, age, disability. Accessibility in design: screen readers, captions, color contrast. Copyright (automatic, life + 70 years), Creative Commons licenses (CC-BY, CC-BY-NC, share alike), fair use (four-factor test, no automatic exceptions), open source (GPL vs. MIT). Plagiarism vs. copyright infringement (academic vs. legal). Algorithmic bias and feedback loops. Crowdsourcing. AI and automation's employment effects. Privacy: PII, HIPAA, FERPA, GDPR (right to be forgotten), third-party data sharing.
CREATE PERFORMANCE TASK (CPT) GUIDE — complete: Program requirements (input, output, list, procedure with parameter that affects functionality, procedure must include sequencing + selection + iteration). Video requirements (60 seconds max, must show input/output and list in use). Written response guidance for all four prompts: Prompt 3a (program PURPOSE — what it does and who it serves, not how it works), Prompt 3b (data abstraction — what the list stores, code showing data stored IN and retrieved FROM the list, why a list manages complexity), Prompt 3c (algorithmic abstraction — procedure with all three building blocks, how it works, why the program would be different without it), Prompt 3d (testing — two different test cases with different inputs, expected outputs, and what each test checks). Common error for each prompt. Video requirements.
100-question practice test + complete answer key with full explanations.
Quick Reference: powers of 2 table (2^1 through 2^30), AP CSP pseudocode summary, algorithm efficiency comparison table.
⭐ WHO THIS BUNDLE IS PERFECT FOR
- Students taking both AP Computer Science A and AP Computer Science Principles — the two courses are offered at many schools and students who take both benefit from having both review resources
- Students deciding between AP CSA and AP CSP who want to understand both exams before choosing
- Teachers who teach both courses and want comprehensive review materials for each
- Students taking AP CSP as a prerequisite or companion to AP CSA who want to see how the conceptual Big Ideas connect to actual Java programming
- Homeschool families whose students are completing one or both courses
- Tutors who work with students in both courses and need a single purchase covering both exams
- Anyone who wants to compare the two courses side by side — AP CSA is a deep dive into Java programming; AP CSP is a broader conceptual survey of computing and its impact
⭐ WHY THESE TWO PACKETS COMPLEMENT EACH OTHER
AP CSA and AP CSP test related but distinct aspects of computing. AP CSA goes deep on one language and one skill — writing Java code. AP CSP goes broad across five Big Ideas — algorithms and programming are only one of them, alongside data, networking, cybersecurity, and societal impact. A student who has studied both will recognize concepts that connect: algorithm efficiency (Big-O) is covered in both; the concept of abstraction appears in both (procedures in CSP, classes and inheritance in CSA); data representation appears in CSP while data structures appear in CSA. Studying both together builds a more complete understanding of the field.
⭐ ALIGNMENT
AP Computer Science A packet: aligned to the College Board AP CSA Course and Exam Description, all 10 units, all 4 FRQ types, Java AP subset. AP Computer Science Principles packet: aligned to the College Board AP CSP Course and Exam Description, all 5 Big Ideas, Create Performance Task requirements, AP pseudocode reference.
