CS Principles · Unit 3 · Paper 3

Algorithms & Programming unit test

A test on this unit alone, marked as a percentage and a letter grade — for the test your class is actually sitting, rather than for May. Answer everything, then submit once: seeing the answer to question 3 before attempting question 4 makes the final percentage meaningless.

Paper 1 Paper 2 Paper 3

Each paper is built from this unit’s 56 terms and is the same for everyone, so a teacher can assign “Unit 3, Paper 3” and every student sits the identical test. Multiple choice is marked objectively; the written sections you mark yourself against the model answer and rubric.

Suggested time 33 min 30 points0/17 attempted

Concatenation

INPUT in AP pseudocode

Sequencing

Binary search

Distributed computing

APPEND

Simulation

Infinite loop

LENGTH

Limitations of simulations

Procedural abstraction

Heuristic

Short answer 1. Define or explain: NOT

3 pts

Short answer 2. Define or explain: Linear search

3 pts

Short answer 3. Define or explain: Algorithm

3 pts

Short answer 4. Define or explain: Robust program

3 pts

Free response

6 pts

A team is writing a program that repeatedly needs the average of a list of numbers: once for quiz scores, once for homework scores, and once for attendance percentages. Their first draft copies the same six lines of code into three places.

Write a procedure average(numbers) in AP-style pseudocode that returns the average of the values in a list, returning 0 for an empty list. List indexes begin at 1.

Explain how defining this procedure manages the complexity of the program.

Explain the role of the parameter and of the return value, and why the procedure is more useful with a parameter than if it always used one fixed global list.

The team then wants a procedure highestAverage that takes three lists and returns the largest of their averages. Describe how it should be written, and name the abstraction it depends on.