Unit 2: Data
CS Principles · Unit 2 · Paper 1

Data 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 1Paper 2Paper 3
Each paper is built from this unit’s 36 terms and is the same for everyone, so a teacher can assign “Unit 2, Paper 1” 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
1

Data abstraction

2

Data cleaning

3

Aggregating data

4

Open data

5

Text as binary

6

Personally identifiable information (PII)

7

Data compression ratio

8

Bias in a program

9

Information vs data

10

Extracting information from data

11

Number of values in n bits

12

Why digital data is discrete

Short answer 1. Define or explain: Filtering data

3 pts

Short answer 2. Define or explain: Choosing lossy or lossless

3 pts

Short answer 3. Define or explain: Bit

3 pts

Short answer 4. Define or explain: Round-off error

3 pts

Free response

6 pts

This course has no free-response prompt tagged to this unit, so one from elsewhere in the course is used. It is still worth writing — the skill transfers.

A student develops a program called StudySprint. The user types in the name of a subject and a number of minutes studied. The program stores every entry in a list, then reports the total minutes studied, the subject studied the most, and a message encouraging the user if the total is under 60 minutes. Write the Create Performance Task style written responses for this program.

Describe the overall purpose of the program and what functionality is demonstrated when a user runs it.

Describe how the program uses a list to manage complexity, and explain why the program could not be written as easily without it.

Identify one algorithm in the program that includes sequencing, selection, and iteration, and explain how each is used.