End-of-course MCQ
70 questions · 2 hours · 70%
Prepare for the end-of-course multiple-choice exam and Create performance task through algorithms, data, networks, systems, impacts, and clear written responses.
Fully digital + Create task. Formats can change, so verify the linked official page before exam day.
Official College Board exam page ↗70 questions · 2 hours · 70%
Through-course program + exam responses · 30%
Each unit is a connected part of the course, not an isolated chapter. The focus says what you must know and the weighting says how much exam time it is worth. Use the weighting to order your review, never as permission to skip a prerequisite.
Program purpose, collaboration, iterative design
Binary, compression, abstraction, data analysis
Variables, lists, procedures, algorithms, simulation
Internet protocols, fault tolerance, parallel computing
Bias, privacy, security, digital divide
This short check is not a score prediction. It identifies which part of the course deserves your next focused session.
Knowing an idea internally is not enough. Practice producing observable evidence under time pressure.
Design and evaluate computational solutions
Develop and analyze algorithms
Abstract program complexity
Analyze data and computing impacts
Explain a personally developed program
A useful sheet records meaning and conditions, not isolated symbols. Rebuild it from a blank page until every line comes back with its conditions attached.
What it tells you: Converts a binary bit pattern into its nonnegative integer value.
Use it when: Each $b_k$ is $0$ or $1$; signed and floating representations need additional conventions.
Example: $10110_2=16+4+2=22$.
What it tells you: Finds the largest unsigned integer representable with $n$ bits.
Use it when: The representation must be unsigned and use exactly $n$ binary digits.
Example: $8$ bits represent values from $0$ through $255$.
What it tells you: Compares storage before and after compression.
Use it when: Use the same size units and distinguish ratio from percent reduction.
Example: $10$ MB compressed to $2$ MB has a $5:1$ ratio and $80\%$ reduction.
What it tells you: Measures how parallel execution changes completion time.
Use it when: Communication and sequential portions limit attainable speedup.
Example: $100$ seconds reduced to $25$ seconds is a fourfold speedup.
| Section or part | What you may use | What that means for your work |
|---|---|---|
| End-of-course multiple choice | No calculator | Binary, compression ratios, and speedup are all small mental arithmetic. |
| Provided during the exam | Exam Reference Sheet | The pseudocode language is given to you. It is not Python or JavaScript, and reading it as if it were is a common way to lose easy points. |
| Create Performance Task | Not applicable | Built during the course on a computer, submitted before exam day, and scored separately. |
Anything the table does not hand you, you have to remember. The AP Computer Science Principles study plan puts these rules on a week-by-week schedule.
Repeat this loop weekly: retrieve, diagnose, repair, mix, time, and reflect.
Original questions, immediate explanations, and local progress.
Start →02A timed mixed-unit test with a complete answer review.
Test →03Eight weeks, plus the timing, calculator, and task-verb decisions.
Plan →04Every unit, its weighting, and what mastery looks like.
Review →05Key relationships, their conditions, and what the exam provides.
Recall →Rules change from section to section. End-of-course multiple choice: no calculator. Provided during the exam: Exam Reference Sheet. Create Performance Task: not applicable. Practise each section under its own rule.
End-of-course multiple choice: 2 hours, 70 questions. Create Performance Task: Through-course, Program plus written responses. End-of-course multiple choice — About 1.7 minutes each. Code-tracing items are slower, so bank time on the vocabulary and impact items. Create Performance Task — Done during the year, not on exam day. Start it early enough to record the video and write the responses without rushing.
Five: Creative Development, Data, Algorithms and Programming, Computer Systems and Networks, Impact of Computing. The roadmap on this page publishes no percentage weighting for them, so order your review by course priority instead, starting with create-task evidence capture.
Yes. The AP Computer Science Principles exam gives you the Exam Reference Sheet. The pseudocode language is given to you. It is not Python or JavaScript, and reading it as if it were is a common way to lose easy points.
Attempt first. Ask for a hint or critique. Close the explanation and solve again from memory. Never use outside help on a live or prohibited assessment.
Start a focused AP Computer Science Principles practice set, check each explanation, and use every miss to choose your next review session.
MathGPT.now is independent and is not affiliated with or endorsed by College Board. Exam formats can change.
Verify AP Computer Science Principles information on AP Central ↗