Treat the list as a dependency map. A later miss may point back to an earlier definition or representation.
Creative Development
Creative Development: Name the objects and notation before applying a rule.
Data
Data: Connect the symbolic form to a graph, diagram, table, or example.
Algorithms and Programming
Algorithms and Programming: Compare two methods and record when each one is valid.
Computer Systems and Networks
Computer Systems and Networks: Finish with an unfamiliar problem and an independent check.
Impact of Computing
Impact of Computing: Name the objects and notation before applying a rule.
Eight original decision checks
These fixed prompts test study and verification choices across the course map. The interactive builder above creates mathematical questions separately.
Question 1: How many different values can be represented with 6 bits?
Data
64
36
12
32
Inspect the reasoning
Each bit is either 0 or 1, so every extra bit doubles the count.
With n bits there are 2^n possible values.
2^6 = 2 x 2 x 2 x 2 x 2 x 2.
That equals 64 values, from 0 through 63.
Best choice: 64
Question 2: A 2,000 KB image is compressed to 400 KB. What percent of the original size was removed?
Data
80%
20%
40%
5%
Inspect the reasoning
The amount removed is 2,000 - 400 = 1,600 KB.
Compare that with the original size.
1,600 / 2,000 = 0.8.
So 80% was removed and 20% remains.
Best choice: 80%
Question 3: Binary search runs on a sorted list of 1,000 items. What is the largest number of comparisons it may need?
Algorithms and Programming
10
500
1,000
100
Inspect the reasoning
Binary search cuts the remaining list in half after each comparison.
After k comparisons at most 2^k items can be distinguished.
2^9 = 512, which is not enough, and 2^10 = 1,024, which is.
So at most 10 comparisons are needed.
Best choice: 10
Question 4: A loop that runs n times contains another loop that also runs n times. How does the running time grow?
Algorithms and Programming
In proportion to n squared
In proportion to n
In proportion to 2 to the power n
It does not depend on n
Inspect the reasoning
The inner loop finishes n steps for every single pass of the outer loop.
The outer loop makes n passes.
Total steps are n x n.
That is n squared, so doubling n makes the program take about four times as long.
Best choice: In proportion to n squared
Question 5: IPv4 addresses use 32 bits. About how many distinct addresses is that?
Computer Systems and Networks
About 4.3 billion
About 4.3 million
About 32 billion
About 65,536
Inspect the reasoning
The number of addresses is 2 raised to the number of bits.
2^32 = 4,294,967,296.
That is about 4.3 billion.
It is not enough for today's devices, which is why IPv6 uses 128 bits.
Best choice: About 4.3 billion
Question 6: Why does splitting a message into packets that travel by different routes make the Internet more reliable?
Computer Systems and Networks
If one path fails, packets can still reach the destination another way.
Packets travel faster than a whole message would.
Packets do not need to be reassembled at the destination.
Each packet is automatically encrypted by the router.
Inspect the reasoning
Routing is decided hop by hop, not fixed in advance.
Because there are many possible paths, a broken link is not fatal.
This redundancy is what makes the network fault tolerant.
Speed and encryption are separate issues, and packets do have to be reassembled in order at the end.
Best choice: If one path fails, packets can still reach the destination another way.
Question 7: A facial recognition tool works less accurately for some skin tones because of its training data. What issue is this?
Impact of Computing
Algorithmic bias inherited from the data
A hardware failure in the camera
A network latency problem
A data compression error
Inspect the reasoning
The program learns patterns from the examples it is given.
If some groups appear rarely in the training set, the model has less to learn from about them.
The resulting uneven accuracy is called algorithmic bias.
Fixing it means changing the data and the testing, not the camera or the network.
Best choice: Algorithmic bias inherited from the data
Question 8: A program gives a wrong result for one specific input but runs without crashing. What kind of error is this?
Creative Development
A logic error
A syntax error
A runtime error
An overflow error
Inspect the reasoning
A syntax error stops the program from running at all.
A runtime error stops the program part way through, with a crash or an exception.
Here the program runs to the end and simply produces the wrong answer.
That is a logic error, best found by testing with inputs whose answers you already know.
Best choice: A logic error
After the run
Sort each miss into interpretation, recall, setup, execution, verification, or pacing. Schedule a changed question that tests the corrected decision without reusing the same surface details.
When should I increase difficulty?
Increase it after setup is accurate without a clue and you can explain why the method fits.
When should I use test mode?
Use it once guided sets are stable and you want evidence about selection, pacing, and sustained attention.
Building your question set…
All course units are eligible.
Printed question coverage
Questions
Review
8 original prompts
Choices, answer, and worked reasoning
What this AP Computer Science Principles rehearsal measures
AP Computer Science Principles allows no calculator on multiple choice.
Exam format: End-of-course multiple choice: 2 hours, 70 questions. Create Performance Task: Through-course, Program plus written responses.
This test mixes all five AP Computer Science Principles units. Study first: Create-task evidence capture.