Part 1: End-of-course MCQ
70 questions · 2 hours · 70%
Rehearse with the same timing, calculator, and reference conditions.Prepare for the end-of-course multiple-choice exam and Create performance task through algorithms, data, networks, systems, impacts, and clear written responses.
Unit review: Define the vocabulary you need to explain, connect it to the unit's representations, then solve a changed item.
Formula review: connect each reference relationship to its meaning, conditions, and a worked example before exam day.
70 questions · 2 hours · 70%
Rehearse with the same timing, calculator, and reference conditions.Through-course program + exam responses · 30%
Rehearse with the same timing, calculator, and reference conditions.These questions examine how you approach a unit, not whether one isolated fact is familiar.
Use exam weighting to allocate review time, while preserving prerequisites that later areas depend on.
Creative Development: Name the objects and notation before applying a rule.
Data: Connect the symbolic form to a graph, diagram, table, or example.
Algorithms and Programming: Compare two methods and record when each one is valid.
Computer Systems and Networks: Finish with an unfamiliar problem and an independent check.
Impact of Computing: Name the objects and notation before applying a rule.
Study a relationship with its meaning and limits attached; isolated symbols are difficult to retrieve under pressure.
Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.
Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.
Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.
Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.
Do not schedule review by comfort. Schedule the activity that will reveal whether the repair transferred.
Locate the earliest uncertain decision.
Rehearse selection and pacing across units.
Convert remaining time into review and rehearsal blocks.
Turn the guide into exam-day skill by practising with the section timing, permitted tools, and task verbs below.
| Exam part | Rule | How to prepare |
|---|---|---|
| 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. |
| Verb | What earns credit |
|---|---|
| Identify | Name the line, the variable, or the procedure. One phrase. |
| Describe | Say what it does from the outside - What goes in and what comes out. |
| Explain how | Walk through the logic step by step, referring to your own code by name. |
| Justify why | Say what problem this choice solved - Why the list, why the procedure, why the parameter. |
| Trace the algorithm | Write a table of variable values after each pass. Guessing from the shape of the code is where most errors happen. |
What it tells you: Converts a binary bit pattern into its nonnegative integer value.
Conditions: 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.
Conditions: 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.
Conditions: 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.
Conditions: Communication and sequential portions limit attainable speedup.
Example: $100$ seconds reduced to $25$ seconds is a fourfold speedup.
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.