AP CSP Master Vocab List

studied byStudied by 17 people
0.0(0)
get a hint
hint

Bit

1 / 133

134 Terms

1

Bit

A contraction of "Binary Digit"; the single unit of information in a computer, typically represented as a 0 or 1

New cards
2

Byte

8 bits

New cards
3

Overflow Error

Error from attempting to represent a number that is too large.

New cards
4

Round-off Error

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

New cards
5

Analog Data

Data with values that change continuously, or smoothly, over time. Some examples of analog data include music, colors of a painting, or position of a sprinter during a race.

New cards
6

Digital Data

Data that changes discretely through a finite set of possible values

New cards
7

Sampling

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

New cards
8

Lossless Compression

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

New cards
9

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.

New cards
10

Binary

A way of representing information using only two options.

New cards
11

Creative Commons

A collection of public copyright licenses that enable the free distribution of an otherwise copyrighted work, used when an author wants to give people the right to share, use, and build upon a work that they have created

New cards
12

Data Compression

A process for reducing the number of bits needed to represent a piece of information

New cards
13

Decimal

a system for representing numbers using combinations of the digits 0 - 9

New cards
14

Intellectual Property

A work or invention that is the result of creativity, such as a piece of writing or a design, to which one has rights and for which one may apply for a patent, copyright, trademark, etc.

New cards
15

Open Access

online research output free of any and all restrictions on access and free of many restrictions on use, such as copyright or license restrictions

New cards
16

Open Source

programs that are made freely available and may be redistributed and modified

New cards
17

Computing Device

a machine that can run a program, including computers, tablets, servers, routers, and smart sensors

New cards
18

Computing System

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

New cards
19

Computing Network

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

New cards
20

Path

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

New cards
21

Bandwidth

the maximum amount of data that can be sent in a fixed amount of time, usually measured in bits per second.

New cards
22

Protocol

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

New cards
23

IP Address

The unique number assigned to each device on the Internet.

New cards
24

Internet Protocol (IP)

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

New cards
25

Router

A type of computer that forwards data across a network

New cards
26

Redundancy

the inclusion of extra components so that a system can continue to work even if individual components fail, for example by having more than one path between any two connected devices in a network.

New cards
27

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, often in groups.

New cards
28

HTTP

HyperText Transfer Protocol - the protocol used for transmitting web pages over the Internet

New cards
29

Internet

a computer network consisting of interconnected networks that use standardized, open (nonproprietary) communication protocols.

New cards
30

Packet

A chunk of data sent over a network. Larger messages are divided into packets that may arrive at the destination in order, out-of-order, or not at all.

New cards
31

Packet Metadata

Data added to packets to help route them through the network and reassemble the original message.

New cards
32

Routing

the process of finding a path from sender to receiver.

New cards
33

UDP

A protocol used on the internet for fast transmission of information but with minimal error checking

New cards
34

World Wide Web

a system of linked pages, programs, and files.

New cards
35

Router

A type of computer that forwards data across a network

New cards
36

Certificate authority

issue digital certificates that validate the ownership of encryption keys used in secure communications and are based on a trust model .

New cards
37

Digital Divide

differing access to computing devices and the Internet, based on socioeconomic, geographic, or demographic characteristics

New cards
38

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, menus, images, text, and graphics.

New cards
39

Input

data that are sent to a computer for processing by a program. Can come in a variety of forms, such as tactile interaction, audio, visuals, or text.

New cards
40

Output

any data that are sent from a program to a device. Can come in a variety of forms, such as tactile interaction, audio, visuals, or text.

New cards
41

Program Statement

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

New cards
42

Program

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

New cards
43

Sequential Programming

program statements run in order, from top to bottom.

New cards
44

Event Driven Programming

some program statements run when triggered by an event, like a mouse click or a key press

New cards
45

Documentation

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

New cards
46

Comment

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

New cards
47

Pair Programming

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

New cards
48

Debugging

Finding and fixing problems in an algorithm or program.

New cards
49

Development process

the steps or phases used to create a piece of software. Typical phases include investigating, designing, prototyping, and testing

New cards
50

Event

associated with an action and supplies input data to a program. Can be generated when a key is pressed, a mouse is clicked, a program is started, or by any other defined action that affects the flow of execution.

New cards
51

Incremental Development Process

a design approach that breaks the problem into smaller pieces and makes sure each piece works before adding it to the whole.

New cards
52

Iterative Development Process

a design approach requires refinement and revision based on feedback, testing, or reflection throughout the process. This may require revisiting earlier phases of the process.

New cards
53

Plagiarism

The use of material created by someone else without permission and presented as one’s own

New cards
54

Program Requirements

descriptions how a program functions and may include a description of user interactions that a program must provide.

New cards
55

Program specification

a description of all the requirements for the program.

New cards
56

Syntax Error

a mistake in the program where the rules of the programming language are not followed.

New cards
57

Software

A program or a collection of programs

New cards
58

Expression

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

New cards
59

Assignment Operator

allows a program to change the value represented by a variable

New cards
60

Variable

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

New cards
61

Boolean Value

a data type that is either true or false.

New cards
62

Comparison Operators

New cards
63

Function

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

New cards
64

Function Call

a command that executes the code within a function

New cards
65

Arithmetic operator

part of most programming languages and include addition, subtraction, multiplication, division, and modulus operators.

New cards
66

Boolean Expression

evaluates to either true or false

New cards
67

Concatenation

joins together two or more strings end-to-end to make a new string.

New cards
68

Conditional Statement

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

New cards
69

Evaluate

Expressions are evaluated to produce a single value.

New cards
70

Expression

a programming statement that can consist of a value, a variable, an operator, or a procedure call that returns a value.

New cards
71

Logical operator

NOT, AND, and OR, which evaluate to a Boolean value.

New cards
72

Procedure

a named group of programming instructions that may have parameters and return values.

New cards
73

Relational operator

used to test the relationship between two variables, expressions, or values. A comparison using a relational operator evaluates to a Boolean value. For example

New cards
74

Selection

determines which parts of an algorithm are executed based on a condition being true or false

New cards
75

String

an ordered sequence of characters.

New cards
76

List

an ordered collection of elements

New cards
77

Element

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

New cards
78

Index

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

New cards
79

Iteration

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

New cards
80

infinite loop

occurs when the ending condition will never evaluate to true.

New cards
81

Traversal

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

New cards
82

Append

add elements to the end of a list

New cards
83

Data abstraction

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

New cards
84

Loops (iteration statements)

change the sequential flow of control by repeating a set of statements zero or more times, until a stopping condition is met

New cards
85

Logic Error

a mistake in the algorithm or program that causes it to behave incorrectly or unexpectedly.

New cards
86

Simulation

abstractions of more complex objects or phenomena for a specific purpose.

New cards
87

Substring

part of an existing string

New cards
88

Problem

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

New cards
89

Algorithm

a finite set of instructions that accomplish a task.

New cards
90

Efficiency

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

New cards
91

Linear Search

a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

New cards
92

Binary Search

a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.

New cards
93

Reasonable Time

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.

New cards
94

Unreasonable Time

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

New cards
95

Heuristic

provides a "good enough" solution to a problem when an actual solution is impractical or impossible

New cards
96

Undecidable Problem

a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

New cards
97

Sequential Computing

a model in which programs run in order, one command at a time.

New cards
98

Parallel Computing

a model in which programs are broken into small pieces, some of which are run simultaneously

New cards
99

Distributed Computing

a model in which programs are run by multiple devices

New cards
100

Speedup

the time used to complete a task sequentially divided by the time to complete a task in parallel

New cards

Explore top notes

note Note
studied byStudied by 7 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 98 people
Updated ... ago
5.0 Stars(2)
note Note
studied byStudied by 62 people
Updated ... ago
5.0 Stars(2)
note Note
studied byStudied by 9 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 3 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 7 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 10 people
Updated ... ago
5.0 Stars(1)
note Note
studied byStudied by 111 people
Updated ... ago
5.0 Stars(1)

Explore top flashcards

flashcards Flashcard38 terms
studied byStudied by 3 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard51 terms
studied byStudied by 151 people
Updated ... ago
5.0 Stars(2)
flashcards Flashcard80 terms
studied byStudied by 52 people
Updated ... ago
5.0 Stars(2)
flashcards Flashcard90 terms
studied byStudied by 52 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard30 terms
studied byStudied by 11 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard40 terms
studied byStudied by 4 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard43 terms
studied byStudied by 5 people
Updated ... ago
5.0 Stars(1)
flashcards Flashcard96 terms
studied byStudied by 40 people
Updated ... ago
5.0 Stars(1)