ap csp vocab

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/107

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:41 AM on 6/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

108 Terms

1
New cards

Lossless Compression

A process for reducing the number of bits needed to represent something without losing any information. This process is reversible.

2
New cards

Lossy Compression

A process for reducing the number of bits needed to represent something in which some information is lost or thrown away. This process is not reversible.

3
New cards

Creative Commons

A collection of public copyright licenses that enable the free distribution of an otherwise copyrighted work

4
New cards

Intellectual Property

A work or invention that is the result of creativity

5
New cards

Analog Data

Data with values that change continuously

6
New cards

Digital Data

Data that changes discretely through a finite set of possible values

7
New cards

Sampling

A process for creating a digital representation of analog data by measuring the analog data at regular intervals called samples.

8
New cards

Overflow Error

Error from attempting to represent a number that is too large

9
New cards

Round-off Error

Error from attempting to represent a number that is too precise. The value is rounded.

10
New cards

Binary

A way of representing information using only two options

11
New cards

Bit

A contraction of "Binary Digit"

12
New cards

the single unit of information in a computer

typically represented as a 0 or 1.

13
New cards

Byte

8 bits

14
New cards

Decimal

A way of representing information using ten numbers

15
New cards

Digital Divide

differing access to computing devices and the Internet

16
New cards

Domain Name System (DNS)

the system responsible for translating domain names like example.com into IP addresses

17
New cards

HyperText Transfer Protocol (HTTP)

the protocol used for transmitting web pages over the Internet

18
New cards

World Wide Web

a system of linked pages

19
New cards

Packet

A chunk of data sent over a network. Larger messages are divided into packets that may arrive at the destination in order

20
New cards

Fault Tolerant

Can continue to function even in the event of individual component failures. This is important because elements of complex systems like a computer network fail at unexpected times

21
New cards

Redundancy

The inclusion of extra components so that a system can continue to work even if individual components fail

22
New cards

Router

A type of computer that forwards data across a network

23
New cards

IP Address

The unique number assigned to each device on the Internet

24
New cards

Internet Protocol (IP)

a protocol for sending data across the Internet that assigns unique numbers (IP addresses) to each connected device

25
New cards

Protocol

An agreed-upon set of rules that specify the behavior of some system

26
New cards

Bandwidth

the maximum amount of data that can be sent in a fixed amount of time

27
New cards

Computing Device

a machine that can run a program

28
New cards

Computing Network

a group of interconnected computing devices capable of sending or receiving data.

29
New cards

Computing System

a group of computing devices and programs working together for a common purpose

30
New cards

Path

the series of connections between computing devices on a network starting with a sender and ending with a receiver

31
New cards

Input

data that are sent to a computer for processing by a program. Can come in a variety of forms

32
New cards

Output

any data that are sent from a program to a device. Can come in a variety of forms

33
New cards

User Interface

the inputs and outputs that allow a user to interact with a piece of software. User interfaces can include a variety of forms such as buttons

34
New cards

Event Driven Programming

some program statements run when triggered by an event

35
New cards

Program

a collection of program statements. Programs run (or “execute”) one command at a time.

36
New cards

Program Statement

a command or instruction. Sometimes also referred to as a code statement.

37
New cards

Sequential Programming

program statements run in order

38
New cards

Comment

form of program documentation written into the program to be read by people and which do not affect how a program runs

39
New cards

Debugging

Finding and fixing problems in an algorithm or program

40
New cards

Documentation

a written description of how a command or piece of code works or was developed

41
New cards

Development Process

the steps or phases used to create a piece of software. Typical phases include investigating

42
New cards

Pair Programming

a collaborative programming style in which two programmers switch between the roles of writing code and tracking or planning high level progress

43
New cards

Assignment Operator

allows a program to change the value represented by a variable

44
New cards

Expression

a combination of operators and values that evaluates to a single value

45
New cards

String

an ordered sequence of characters

46
New cards

Variable

a named reference to a value that can be used repeatedly throughout a program

47
New cards

Boolean Value

a data type that is either true or false

48
New cards

Comparison Operator

<
49
New cards

Logical Operator

NOT

50
New cards

Conditional Statement

affects the sequential flow of control by executing different statements based on the value of a Boolean expression

51
New cards

Function

a named group of programming instructions. Also referred to as a “procedure”.

52
New cards

Function Call

a command that executes the code within a function

53
New cards

Information

the collection of facts and patterns extracted from data.

54
New cards

Big Data

data that is so large that it is difficult or impossible to process using traditional methods. (SAS

55
New cards

Metadata

data about data

56
New cards

Cleaning Data

a process that makes the data uniform without changing its meaning (e.g.

57
New cards

Data Filtering

choosing a smaller subset of a data set to use for analysis

58
New cards

Correlation

a relationship between two pieces of data

59
New cards

Citizen Science

scientific research conducted in whole or part by distributed individuals

60
New cards

Crowdsourcing

the practice of obtaining input or information from a large number of people via the Internet.

61
New cards

Data Bias

inaccurate

62
New cards

Data Analytics

The act of analyzing big data sets to look for trends and correlations that aren't visible without analysis

63
New cards

Data Abstraction

manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation

64
New cards

Element

an individual value in a list that is assigned a unique index

65
New cards

Index

a common method for referencing the elements in a list or string using numbers

66
New cards

List

an ordered collection of elements

67
New cards

Infinite Loop

occurs when the ending condition will never evaluate to true

68
New cards

Iteration

a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met

69
New cards

Traversal

the process of accessing each item in a list one at a time

70
New cards

Argument

the value passed to the parameter

71
New cards

Parameter

a variable in a function definition. Used as a placeholder for values that will be passed through the function

72
New cards

Return

used to return the flow of control to the point where the procedure (also known as a function) was called and to return the value of expression

73
New cards

Procedural Abstraction

a process and allows a procedure to be used only knowing what it does

74
New cards

API

Application Program Interface - specifications for how functions in a library behave and can be used

75
New cards

Library

a group of functions (procedures) that may be used in creating new programs

76
New cards

Modularity

the subdivision of a computer program into separate subprograms

77
New cards

Keylogging

the use of a program to record every keystroke made by a computer user in order to gain fraudulent access to passwords and other confidential information

78
New cards

Malware

software intended to damage a computing system or to take partial control over its operation

79
New cards

Phishing

a technique that attempts to trick a user into providing personal information. That personal information can then be used to access sensitive online resources

80
New cards

Rouge Access Point

a wireless access point that gives unauthorized access to secure networks

81
New cards

Computing Innovation

includes a program as an integral part of its function. Can be physical (e.g. self-driving car)

82
New cards

Personally Identifiable Information (PPI)

information about an individual that identifies

83
New cards

Decryption

a process that reverses encryption

84
New cards

Encryption

a process of encoding messages to keep them secret

85
New cards

Public Key Encryption

pairs a public key for encryption and a private key for decryption. The sender does not need the receiver’s private key to encrypt a message

86
New cards

Symmetric Key Encryption

involves one key for both encryption and decryption

87
New cards

Computer Virus Scanning Software

protects a computing system against infection

88
New cards

Multi-factor Authentication

a system that requires at least two steps to unlock protected information

89
New cards

each step adds a new layer of security that must be broken to gain unauthorized access

90
New cards

Algorithm

a finite set of instructions that accomplish a task

91
New cards

Iteration

a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met

92
New cards

Problem

a general description of a task that can (or cannot) be solved with an algorithm

93
New cards

Selection

deciding which steps to do next

94
New cards

Sequencing

putting steps in an order

95
New cards

Binary Search

a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data

96
New cards

this process repeats until the desired value is found or all elements have been eliminated

97
New cards

Efficiency

a measure of how many steps are needed to complete an algorithm

98
New cards

Linear Search

a search algorithm which checks each element of a list

99
New cards

Reasonable Time

Algorithms with a polynomial efficiency or lower (constant

100
New cards

Unreasonable Time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time