AP CSP Vocab

Question 1

Problem

Answer 1

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

Question 2

Algorithm

Answer 2

a finite set of instructions that accomplish a task

Question 3

Efficiency

Answer 3

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

Question 4

Linear Search

Answer 4

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

Question 5

Binary Search

Answer 5

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

Question 6

Unreasonable Time

Answer 6

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

Question 7

Reasonable Time

Answer 7

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

Question 8

Undecidable Problem

Answer 8

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

Question 9

Sequential Computing

Answer 9

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

Question 10

Parallel Computing

Answer 10

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

Question 11

Distributed Computing

Answer 11

a model in which programs are run by multiple devices

Question 12

Speedup

Answer 12

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

Question 13

Distributed Algorithm

Answer 13

a sub-type of parallel algorithm, typically executed concurrently, with separate parts of the algorithm being run simultaneously on independent processors, and having limited information about what the other parts of the algorithm are doing

Question 14

Parallel Algorithm

Answer 14

algorithm which can do multiple operations in a given time

Question 15

Overflow Error

Answer 15

Error from attempting to represent a number that is too large

Question 16

Round-off Error

Answer 16

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

Question 17

Lossy Compression

Answer 17

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

Question 18

Analog Data

Answer 18

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

Question 19

Digital Data

Answer 19

Data that changes discretely through a finite set of possible values

Question 20

Sampling

Answer 20

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

Question 21

Computing Device

Answer 21

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

Question 22

Internet

Answer 22

the hub where all digital information is pulled from

Question 23

Network

Answer 23

The pieces of a system being put together or working together

Question 24

Computing Network

Answer 24

two or more computers that are connected with one another for the purpose of communicating data electronically

Question 25

Computing System

Answer 25

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

Question 26

IP Address

Answer 26

the shared way that all devices and computers label their messages with the sender and receiver’s addresses

Question 27

Simulator

Answer 27

a system that is meant to replicate a feeling or topic

Question 28

Router

Answer 28

connect multiple devices to the internet through one location

Question 29

Packet

Answer 29

a smaller portion of a large file sent through the internet to decrease risk while being sent

Question 30

Fault Tolerant

Answer 30

Having different options for paths in a network in the event something could go wrong

Question 31

Transmission Control Protocol (TCP)

Answer 31

Manages the sending and receiving of all your data as packets

Question 32

Datastream

Answer 32

The way in which information travels on the Internet, not as a single piece but in chunks

Question 33

User Datagram Protocol (UDP)

Answer 33

Sends all packets without checking whether they were received or ordered properly

Question 34

Domain Name System (DNS)

Answer 34

translates domain names to IP addresses so browsers can load Internet resources. Each device connected to the Internet has a unique IP address which other machines use to find the device

Question 35

HTTP

Answer 35

Hypertext Transfer Protocol (HTTP) is an application-layer protocol for transmitting hypermedia documents

Question 36

Hyper Text Markup Language (HTML)

Answer 36

think of that as the language you use to tell a web browser how to make a page look

Question 37

The World Wide Web

Answer 37

is a collection of pages and files that is shared between computers using HTTP

Question 38

Net Neutrality

Answer 38

the principle that Internet service providers (ISPs) must treat all Internet communications equally, and not discriminate or charge differently based on user, content, website, platform, application, type of equipment, source address, destination address, or method of communication

Question 39

Input

Answer 39

Data given to the computer through a user’s action

Question 40

Output

Answer 40

Data given to the user through a computer’s action