Programming Logic
Lists, Procedures, and Abstraction
Data and Representation
Internet and Networks
Security, Impacts, and Big Ideas
100

Code that makes a decision using IF or IF/ELSE.

Selection

100

A collection of values stored together and accessed by position.

A collection of values stored together and accessed by position.

100

A number system that uses only 0s and 1s.

Binary  

100

A small piece of data sent across a network.

Packet

100

A scam that tricks users into giving personal information, often through fake emails, links, or forms.

Phishing

200

Code that repeats steps using a loop.

Iteration

200

A variable in a procedure definition that receives a value.

Parameter 

200

The smallest unit of data; one 0 or 1.

Bit

200

A set of rules that devices use to communicate.

Protocol

200

Encoding data so unauthorized users cannot read it.

Encryption

300

A value that is either true or false.

Boolean

300

A named block of code that can be called to perform a task.

Procedure

300

Data that describes other data, such as file size, date created, author, or location.

Metadata

300

A unique address assigned to a device so it can send and receive data on a network.

IP Address

300

The gap between people who have access to computing resources and those who do not.

Digital Divide

400

A true/false expression that controls whether code runs

Condition

400

A way to manage complexity by hiding details and focusing on the big idea.

Abstraction

400

Reducing file size while still allowing the original file to be perfectly restored.

Lossless Compression

400

Having more than one possible path for data to travel across a network.

Redundant Routing

400

Unfair or skewed results caused by flawed data, algorithms, assumptions, or sampling.

Bias

500

A step-by-step process used to solve a problem.

Algorithm

500

The position of an item in a list; on the AP CSP exam reference sheet, it starts at 1.

Index

500

Reducing file size by permanently removing some data.

Lossy Compression

500
The ability of a system to keep working even if part of it fails

Fault Tolerance

500

An algorithm runs efficiently enough to be practical as the input size grows.


Reasonable Time