AP CSP VOCAB REVIEW

studied byStudied by 0 people
0.0(0)
Get a hint
Hint

Binary

1 / 105

flashcard set

Earn XP

Description and Tags

All vocab from each unit

106 Terms

1

Binary

a way of representing only two options

New cards
2

decimal

a way of representing information using ten options

New cards
3

bit

a contraction of binary digit. A bit is the single unit of information in a computer, typically represented as a 0 or 1.

New cards
4

byte

8 bits

New cards
5

overflow error

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

New cards
6

round off error

error from attempting to represent a number that is too precise. the value is rounded

New cards
7

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
8

digital data

Data that changes discreetly through a finite set of possible values

New cards
9

sampling

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

New cards
10

lossless compression

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

New cards
11

lossy compression

a process for reducing the number of bits needed to represent something in which information s lost or thrown away. This process IS NOT reversible

New cards
12

Intellectual property

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

New cards
13

creative common

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
14

computing device

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

New cards
15

computing system

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

New cards
16

computing network

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

New cards
17

path

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

New cards
18

bandwidth

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

New cards
19

protocol

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

New cards
20

ip address

the unique number assigned to each device on the internet

New cards
21

internet protocol (IP)

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

New cards
22

router

a type of computer that forwards data across a network

New cards
23

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
24

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
25

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
26

HyperText Transfer Protocol (HTTP)

the protocol used for transmitting web pages over the Internet

New cards
27

Domain Name System (DNS)

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

New cards
28

internet

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

New cards
29

World Wide Web (WWW)

a system of linked pages programs and files

New cards
30

Digital divide

differing access to computing and the internet based on socioeconomic geographic or demographic characteristics

New cards
31

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
32

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
33

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
34

program statement

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

New cards
35

program

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

New cards
36

sequential programming

program statements run in order, from top to bottom.

New cards
37

event driven programming

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

New cards
38

docummentation

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

New cards
39

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
40

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
41

debugging

finding and fixing problems in an algorithm or program

New cards
42

development process

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

New cards
43

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
44

expression

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

New cards
45

assignment operator

allows a program to change the value represented by a variable

New cards
46

variable

a named reference to a value that can be used repeatedly

New cards
47

string

an ordered sequence of characters

New cards
48

boolean value

a data type that is either true or false

New cards
49

comparison operators

<, >, <=, >=, ==, != indicate a Boolean expression

New cards
50

logical operator

NOT, AND, and OR which evaluate to a boolean value

New cards
51

conditional statement

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

New cards
52

function

a named group of programming instructions. also referred to as a procedure

New cards
53

function call

a command that executes the code within a function

New cards
54

metadata

data about data

New cards
55

citizen science

scientific research conducted in whole or part by distributed individuals, many of whom may not be scientists, who contribute relevant data to research using their own computing devices.

New cards
56

cleaning data

a process that makes the data uniform without changing its meaning (e.g., replacing all equivalent abbreviations, spellings, and capitalizations with the same word).

New cards
57

correlation

a relationship between two pieces of data, typically referring to the amount that one varies in relation to the other

New cards
58

crowdsourcing

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

New cards
59

information

the collection of facts and patterns extracted from data

New cards
60

data bias

data that does not accurately reflect the full population or phenomenon being studied

New cards
61

data filtering

choosing a smaller subset of a data set to use for analysis, for example by eliminating / keeping only certain rows in a table

New cards
62

list

an ordered collection of elements

New cards
63

element

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

New cards
64

index

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

New cards
65
New cards
66

Iteration

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

New cards
67

Infinite loop

occurs when the ending condition will never evaluate to true

New cards
68

Traversal

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

New cards
69

Data Abstraction

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

New cards
70

parameter

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

New cards
71

argument

the value passed to the parameter

New cards
72

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

New cards
73

procedural abstraction

a process and allows a procedure to be used only knowing what it does, not how it does it. Procedural abstraction allows a solution to a large problem to be based on the solution of smaller subproblems. This is accomplished by creating procedures to solve each of the subproblems.

New cards
74

library

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

New cards
75

Application Program Interface (API)

specifications for how functions in a library behave and can be used

New cards
76

Modularity

The subdivision of a computer program into separate subprograms

New cards
77

Computing Innovation

includes a program as an integral part of its function. Can be physical (e.g. self-driving car), non-physical computing software (e.g. picture editing software), or non-physical computing concepts (e.g., e-commerce).

New cards
78

PPI

personally identifiable information - information about an individual that identifies, links, relates or describes them.

New cards
79

Phishing

a technique to gain personal information for the purpose of identity theft, usually by means of fraudulent e-mail

New cards
80

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

New cards
81

malware

software that is intended to damage or disable computers and computer systems.

New cards
82

rogue access point

a wireless access point that gives unauthorized access to secure networks.

New cards
83

encryption

a process of encoding messages to keep them secret, so only "authorized" parties can read it.

New cards
84

decryption

a process that reverses encryption, taking a secret message and reproducing the original plain text

New cards
85

Symmetric Key Encryption

involves one key for both encryption and decryption.

New cards
86

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, but the receiver's private key is required to decrypt the message

New cards
87

Multi-factor Authentication

a system that requires at least two steps to unlock protected information; each step adds a new layer of security that must be broken to gain unauthorized access

New cards
88

Computer Virus Scanning Software

protects a computing system against infection

New cards
89

problem

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

New cards
90

algorithm

a finite set of instructions that accomplish a task

New cards
91

Sequencing

putting steps in an order

New cards
92

selection

deciding which steps to do next

New cards
93

iteration

doing some steps over and over

New cards
94

efficiency

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

New cards
95

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.bina

New cards
96

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
97

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
98

unreasonable time

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

New cards
99

heuristic

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

New cards
100

decision problem

a problem with a yes/no answer (e.g., is there a path from A to B?)

New cards

Explore top notes

note Note
studied byStudied by 2525 people
... ago
5.0(3)
note Note
studied byStudied by 36 people
... ago
5.0(5)
note Note
studied byStudied by 8 people
... ago
5.0(1)
note Note
studied byStudied by 91 people
... ago
5.0(2)
note Note
studied byStudied by 25 people
... ago
5.0(1)
note Note
studied byStudied by 5 people
... ago
5.0(1)
note Note
studied byStudied by 37 people
... ago
5.0(2)
note Note
studied byStudied by 37 people
... ago
5.0(2)

Explore top flashcards

flashcards Flashcard (76)
studied byStudied by 5 people
... ago
5.0(1)
flashcards Flashcard (32)
studied byStudied by 14 people
... ago
5.0(2)
flashcards Flashcard (57)
studied byStudied by 3 people
... ago
5.0(1)
flashcards Flashcard (24)
studied byStudied by 19 people
... ago
5.0(1)
flashcards Flashcard (81)
studied byStudied by 2 people
... ago
5.0(1)
flashcards Flashcard (277)
studied byStudied by 55 people
... ago
5.0(1)
flashcards Flashcard (20)
studied byStudied by 5 people
... ago
5.0(1)
flashcards Flashcard (40)
studied byStudied by 50 people
... ago
5.0(1)
robot