What would you like to understand?

Popular destinationsCalculatorsCoursesPracticeFormulas

Unlock Premium Help

Explore every tutor and study workspace for seven days, with no daily AI cap during the trial.

Choose a billing period
Ask a parent to pay

Nothing is charged during the first seven days. Unless you cancel, the plan you selected begins when the trial ends and renews on its stated schedule. Manage cancellation from your plan page. Stripe handles the payment details.

AP Computer Science Principles exam prep: turn the syllabus into a study system

Prepare for the end-of-course multiple-choice exam and Create performance task through algorithms, data, networks, systems, impacts, and clear written responses.

5areas

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.

Exam arrangement

Fully digital + Create task

Confirm the current official format ↗

Part 1: End-of-course MCQ

70 questions · 2 hours · 70%

Rehearse with the same timing, calculator, and reference conditions.

Part 2: Create task and written response

Through-course program + exam responses · 30%

Rehearse with the same timing, calculator, and reference conditions.

Preparation diagnostic

These questions examine how you approach a unit, not whether one isolated fact is familiar.

Question 1 of 3

Content map

Use exam weighting to allocate review time, while preserving prerequisites that later areas depend on.

Creative Development

Creative Development: Name the objects and notation before applying a rule.

  • Retrieve the central vocabulary and representation.
  • Work one direct item without time pressure.
  • Mix this area with a neighboring unit.
  • Record the first decision that needs repair.
Required

Data

Data: Connect the symbolic form to a graph, diagram, table, or example.

  • Retrieve the central vocabulary and representation.
  • Work one direct item without time pressure.
  • Mix this area with a neighboring unit.
  • Record the first decision that needs repair.
Required

Algorithms and Programming

Algorithms and Programming: Compare two methods and record when each one is valid.

  • Retrieve the central vocabulary and representation.
  • Work one direct item without time pressure.
  • Mix this area with a neighboring unit.
  • Record the first decision that needs repair.
Required

Computer Systems and Networks

Computer Systems and Networks: Finish with an unfamiliar problem and an independent check.

  • Retrieve the central vocabulary and representation.
  • Work one direct item without time pressure.
  • Mix this area with a neighboring unit.
  • Record the first decision that needs repair.
Required

Impact of Computing

Impact of Computing: Name the objects and notation before applying a rule.

  • Retrieve the central vocabulary and representation.
  • Work one direct item without time pressure.
  • Mix this area with a neighboring unit.
  • Record the first decision that needs repair.
Required

Reference relationships

Study a relationship with its meaning and limits attached; isolated symbols are difficult to retrieve under pressure.

Binary place value

\[(b_nb_{n-1}\ldots b_0)_2=\sum_{k=0}^n b_k2^k\]

Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.

Maximum unsigned value

\[\text{max}=2^n-1\]

Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.

Compression ratio

\[\text{ratio}=\frac{\text{original size}}{\text{compressed size}}\]

Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.

Parallel speedup limit

\[\text{speedup}=\frac{T_{\mathrm{sequential}}}{T_{\mathrm{parallel}}}\]

Before using it, name every quantity, confirm the permitted conditions, and predict the sign or scale.

Choose the next evidence

Do not schedule review by comfort. Schedule the activity that will reveal whether the repair transferred.

Diagnostic practice

Locate the earliest uncertain decision.

Timed course test

Rehearse selection and pacing across units.

Eight-week map

Convert remaining time into review and rehearsal blocks.

AP Computer Science Principles study plan and strategy

Turn the guide into exam-day skill by practising with the section timing, permitted tools, and task verbs below.

Calculator and reference rules for AP Computer Science Principles

Exam partRuleHow to prepare
End-of-course multiple choiceNo calculatorBinary, compression ratios, and speedup are all small mental arithmetic.
Provided during the examExam Reference SheetThe 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 TaskNot applicableBuilt during the course on a computer, submitted before exam day, and scored separately.

Task verbs

VerbWhat earns credit
IdentifyName the line, the variable, or the procedure. One phrase.
DescribeSay what it does from the outside - What goes in and what comes out.
Explain howWalk through the logic step by step, referring to your own code by name.
Justify whySay what problem this choice solved - Why the list, why the procedure, why the parameter.
Trace the algorithmWrite a table of variable values after each pass. Guessing from the shape of the code is where most errors happen.

Reference and calculator rules for AP Computer Science Principles

Binary place value

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$.

Maximum unsigned value

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$.

Compression ratio

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.

Parallel speedup limit

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.

Start AP Computer Science Principles practice

Questions to settle before exam week

Can I use a calculator on the AP Computer Science Principles exam?

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.

How long is the AP Computer Science Principles exam?

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.

How many units does AP Computer Science Principles cover?

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.

Is a formula sheet given on the AP Computer Science Principles exam?

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.