Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

AP CSP > AP Vocab > Flashcards

AP Vocab Flashcards

(115 cards)

Start Studying
1
Q

Documentation

A

Written information that describes how to use procedures and variables in a given code segment. For example, documentation may provide information about a procedure’s signature or purpose.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Incremental development OR
Iterative development

A

Developing a program gradually by implementing one feature at a time and then improving the program to include more features over time.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Logic error

A

A mistake in an algorithm or program that causes it to behave unexpectedly or return the incorrect value. Code with a logic error will most likely run but will not work as intended.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Run-time error

A

A mistake in a program that happens only when the program is actually run, such as providing an incorrect data type to a procedure. Code with a run-time error will produce an error message when it is run.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Syntax

A

The arrangement of words and phrases to create well-formed sentences in a language (this applies to spoken/written language as well as programming languages).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Syntax error

A

A mistake in typed code that violates the rules of the programming language. In most programming languages, code with syntax errors will not run.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Analog data

A

Values that change smoothly, rather than in discrete intervals, over time. For example, the pitch and volume of a live concert.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Bit

A

The smallest unit of data stored on computers. The value of a bit can only be either 0 or 1. At the lowest level, all data is stored on a computer using bits.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Boolean

A

A value that is either true or false.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Byte

A

8 bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Binary

A

A way of representing numeric values using only 0s and 1s.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Lossless compression

A

A type of data compression in which the original data can be fully restored without losing any information. This type of compression generally does not compress data as much as lossy compression.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Lossy compression

A

A type of data compression in which the original data cannot be fully restored and some data is lost. Generally the data lost is insignificant (e.g. several bits).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Metadata

A

Data about data. For example, a file’s metadata often includes information about when the file was created or how large the file is.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Memory

A

The number of bits used to store a given value or program.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Overflow error

A

An error that occurs when the number of bits used to store a value is not enough to represent the number. Most programming languages that use a fixed-width for numbers will provide an error message when an overflow occurs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Rounding error

A

An error that occurs when the representation of a number does not have sufficient precision because computers cannot store numbers with infinite precision.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Sampling

A

The process of taking discrete measurements (samples) of a continuous signal or process to represent it in a digital format. This process is used to measure analog data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Sampling error

A

An error that occurs when the discrete measurements taken by a computer are insufficient to fully represent a continuous signal or process.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

String

A

A sequence of characters.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Abstraction

A

The generalization of values or procedures.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Algorithm

A

A set of steps to complete a task or solve a problem.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

API

A

A library of procedures and a description of how to call each procedure.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Argument

A

The value given to a parameter during a procedure call.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Binary search
An algorithm that searches a sorted list for a value by repeatedly splitting the list in half. The most efficient searching algorithm we know.
26
Conditional
A code segment that uses selection.
27
Evaluate
To run a code segment and determine the value produced.
28
Expression
A code segment that evaluates to a value.
29
Flowchart
A way to visually represent an algorithm using boxes and arrows to show the steps taken.
30
Heuristic
An algorithm that produces an approximate result in less time than it would take to produce the actual result desired. This type of algorithm is generally used when a problem cannot be solved in a reasonable amount of time.
31
Index
The position of a character in a string or an element in a list. On the AP exam valid indexes are always between 1 and the length of the string/list (inclusive).
32
Infinite loop
A code segment that repeats without stopping.
33
Iteration
The repetition of steps in an algorithm or program for a certain amount of times or until a certain condition is met.
34
Library
A collection of procedures that are useful in creating programs.
35
Linear search
An algorithm that iterates through each item in a list until it finds the target value.
36
List
A data type that can contain any number of values of any type.
37
Logic circuit
A visual representation of an algorithm that takes in Boolean values and produces a Boolean value.
38
Logic gate
A way of combining or altering Boolean values (the three we have learned about are AND, OR, or NOT).
39
Modularity
The separation of a program into independent modules that are each responsible for one aspect of the program's functionality.
40
Parameter
The name of an input variable used in a procedure.
41
Procedure
A named code segment that can be used to perform the same task with different values.
42
Procedure call
A code segment that makes use of an existing procedure.
43
Reasonable time
A run time for an algorithm that doesn't increase faster than a polynomial function of the input size. This classification is used to describe the run time of algorithms on very large data sets.
44
Runtime
The time it takes to completely execute a program or code segment. This is also called “execution time”.
45
Selection
Part of an algorithm that chooses between one or more options.
46
Sequencing
The sequential execution of steps in an algorithm or code in a program.
47
Simulation
A computer model used to imitate a process or situation. A simulation is generally used when it is impractical to complete a real-life experiment of some kind.
48
Statement
A code segment that does not necessarily produce a value but has some effect.
49
Traversal
The iteration over the items in a list. A full traversal iterates over every item, while a partial traversal iterates over a subset of the items.
50
Undecidable
A problem that cannot be solved in any amount of time, even if that time is considered “unreasonable”. To show that a problem is undecidable you must provide an example of a situation for which the algorithm to solve that problem cannot be created.
51
Variable
A named storage location in a computer's memory that can hold a value, which can change during a program's execution.
52
Bandwidth
The maximum amount of data that can be sent in a fixed period of time over a network connection (typically measured in bits per second).
53
Computer network
A group of interconnected computing devices capable of sending or receiving data.
54
Computing device
A physical device that can run a program, such as a computer, smart phone, or smart sensor.
55
Distributed computing
A computational model which uses multiple devices to run different parts of a program.
56
Domain name
A portion of a network address
57
Domain name service (DNS)
The system that translates domain names to IP addresses
58
Fault tolerance
The ability of a network to continue operating when one device or connection fails.
59
HTTP
The protocol that powers the Web, used to request web pages from servers and submit form data to servers.
60
IETF
A group that is responsible for developing and approving the changing protocols of the internet.
61
IP
The protocol that adds an IP header to each packet to determine its destination and determines how to route data from one node to a destination node.
62
IP address
A unique identifier given to each device on a network.
63
Internet
A series of interconnected devices that allow you to use the world wide web.
64
Network
A group of interconnected things or devices.
65
Packet
A “chunk” of data which includes a portion of the data that needs to be sent as well as the IP addresses of the sender and receiver.
66
Parallel computing
A computational model which splits a program into multiple tasks, some of which can be executed simultaneously.
67
Protocol
An agreed upon set of rules that specify the behavior of a system.
68
Redundant routing
See “fault tolerance”
69
Router
A connection point between the networks of the internet.
70
Scalability
The ability of a system to adjust in scale to meet new demands (e.g. an increasing number of users).
71
TCP
The protocol used by the “transport” layer of the internet to split information into packets when sending and re-order the information upon receiving the data. This protocol includes mechanisms for reliably transmitting packets to a destination.
72
UDP
The protocol used by the transport layer of the internet when sending or receiving streaming data. This protocol contains minimal error checking.
73
World wide web
A system of linked pages, media, and files, browsable over HTTP.
74
Antivirus software
A type of software that monitors downloads and warns users of files that resemble malware. This software cannot prevent users from downloading malware.
75
Artificial intelligence
Programs that are able to perform tasks that normally require human intelligence such as visual perception, speech recognition, decision-making, and translation between languages.
76
Caesar cipher
A type of symmetric encryption in which each character is shifted by a set amount.
77
Certificate authority
A third party that validates public keys to ensure that they come from safe sources.
78
Citizen science
The participation of volunteers from the public in a scientific research project (a type of crowdsourcing)
79
Cloud
A network of remote servers hosted on the internet, providing access to various computing resources and services.
80
Cloud computing
Using the cloud to store data or perform tasks. This can enhance collaboration but can also cause security concerns.
81
Cookie
A small amount of text that tracks information about a user visiting a website.
82
Copyright
Exclusive ownership and control over original works of authorship.
83
Creative commons
An alternative to copyright that allows people to declare how they want their artistic creations to be shared, remixed, and used in noncommercial contexts, as well as how the policy should propagate with remixed versions.
84
Crowdsourcing
A model in which many online users combine efforts to help fund projects, generate ideas, or create goods or services.
85
Decryption
The process of de-scrambling data to return to the original data.
86
Digital certificate
A certificate issued by a certificate authority that verifies the identity of a public key.
87
Digital divide
The idea that some communities or populations have less access to computing than others, typically due to limitations of Internet speed or computer hardware access.
88
DMCA
A law that updates copyright rules for the digital age including making it illegal to bypass digital locks on copyrighted content, as well as protecting platforms from liability if users violate copyright.
89
Encryption
The process of scrambling data to prevent unauthorized access.
90
Fair use
The limited use of copyrighted material without permission from the copyright holder. Examples of fair use include title, parodies, short excerpts, and specific educational uses.
91
Freeware
Software that is available to download for free. This software may still have restrictions on its use, modification, or distribution.
92
Keylogging
A type of malware that records what is typed on a device in an effort to determine a user’s passwords or other key information.
93
Machine learning
Computer programs that are able to learn and adapt without following explicit instructions, by using algorithms and statistical models to analyze and draw inferences from patterns in data.
94
Malware
Software designed to harm your computer or data.
95
Multi-factor authentication (MFA)
A method of user authentication which requires the user to present multiple pieces of evidence in multiple categories in order to log in.
96
Open access
A policy that allows people to have access to documents (like research papers) for reading or data (like government datasets) for analysis.
97
Open source software
Computer software for which the source code is publicly available and licensed under a model that allows users to study, modify, and distribute the software for any purpose.
98
Personally identifiable information (PII)
Information about an individual that can be used to uniquely identify them (directly or indirectly).
99
Phishing
An attack where a user is tricked into revealing private information, often via a deceptive email.
100
Private key
The key used to decrypt data in public key encryption.
101
Public domain
The group of works that are available to the public and are not subject to copyright.
102
Public key
The key used to encrypt data in public key encryption.
103
Rogue access point
A wireless access point that provides an attacker with unauthorized access to the traffic going over the network.
104
Shareware
Software that is available free of charge and often distributed informally for evaluation, after which a fee may be requested for continued use.
105
Shift cipher
See “Caesar cipher”
106
Substitution cipher
A type of symmetric encryption in which each character is replaced by another character in some random order.
107
Symmetric encryption
A technique for encrypting data where the same key is used to both encrypt and decrypt data.
108
Testing data
Data used in a machine learning algorithm for which the user does not know the correct answer.
109
Training data
Data used in a machine learning algorithm for which the user already knows the correct answer.
110
Trojan horse
A type of malware that is disguised as a legitimate program.
111
Virus
A type of malware that can make copies of itself.
112
Application Layer
Handles the actual data or message being sent; Protocols: HTTP, HTTPS, FTP
113
Transport Layer
Breaks the message into smaller packets, numbers them, and ensures they are delivered correctly and in order; Protocols: TCP, UDP
114
Internet Layer (Network Layer)
Handles addressing and routing — decides where the packets go, based on IP addresses - Like writing an address on an envelope; Protocol: IP (Internet Protocol)
115
Link Layer (or Network Interface Layer)
Handles the physical connection between devices (like wires, Wi-Fi, Ethernet) and gets the packets from one node to the next.

AP CSP (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions