All AP CSP Exam Vocabulary

0.0(0)
studied byStudied by 6 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/96

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

97 Terms

1
New cards

Common models

allow pair programming

2
New cards

Logical error

a mistake in the algorithm that makes the program malfunction

  • will not stop the program from showing an error, but, your program won’t work as intended

3
New cards

Syntax error

an error where the rules of a programming language is not followed

  • the program will not run

4
New cards

Run-time error

an error that occurs during the execution of a program

  • the program doesn't fully run

  • program will terminate at the point of error 

5
New cards

Overflow error

an error that occurs when the data exceeds the maximum storage of the container

  • the program runs but won’t work as intended

6
New cards

Round-off errors

an error that occurs when an exact number cannot be represented due to limited storage

  • the program runs but won’t work as intended

7
New cards

Binary digit

a bit

8
New cards

Bit

the smallest unit of data in computing 

  • represent all digital data 

9
New cards

Byte

group of 8 bits 

  • instructions for the computer

10
New cards

Analog data

data stored in physical ways (real life data) 

  • e.g.: camera, cuckoo clock

11
New cards

Abstraction

reducing complexity so it's easier to understand

  • simplifying things that do the same thing 

  • e.g.: procedures, variables 

12
New cards

Sampling

measure the values of the analog signal at regular intervals 

  • to store analog data in digital form

13
New cards

Lossless data compression

reduce the number of bits stored/sent while keeping all the original data & quality

  • when preserving data quality is most important 

14
New cards

Lossy data compression

reduce the number of bits significantly, but only allows an approximation of the original data to be reconstructed

  • when minimizing data size or transmission time is most important 

15
New cards

Information

collection of facts & patterns extracted from data

16
New cards

Metadata

data about data

  • the source, destination, file size, data of creation, & any other information about the piece of data

17
New cards

Cleaning data

the process of making data uniform without changing their meaning

  • e.g.: removing uppercase letters in all variable names

18
New cards

Programs

can be used to process data to acquire Information 

19
New cards

Variable

a symbol that represents a value, it's a placeholder for a number or quantity that can be manipulated in equations, calculations, or programs

20
New cards

Boolean

a data type that can only hold 2 values: true or false

  • yes/no question

  • if statement

21
New cards

Lists

stores multiple related items under a single variable name

22
New cards

List element

an individual value in a list that is assigned an index

23
New cards

List index

each item in a collection has a number associated with it

  • College Board starts with index 1

24
New cards

Algorithm

sequence of steps

  • a combination of sequencing, selection, iteration

25
New cards

Sequencing

the order in which instructions are executed in a program

26
New cards

Selection

conditional statements (e.g. if, elif, else)

27
New cards

Iteration

loops (e.g. while, for)

28
New cards

Strings

a sequence of characters or text

29
New cards

String concatenation

joins together two or more strings to make a new string 

30
New cards

Substring

a string of characters that exists inside a string

  • e.g. the first three characters of a password

31
New cards

Nested Conditionals

an if statement placed within another if statement or else block

32
New cards

Linear or Sequential search

each element in the list is examined (starting with the 1st element) until the desired number is found or the list ends 

  • numbers don’t need to be in order 

33
New cards

Binary search

a strategy to cut time by jumping data you don’t need

  • numbers must be in order

34
New cards

Procedure

a function

35
New cards

Parameters

the variables you're going to be using in the function

  • defines a system or sets conditions 

  • def function (x, y)

36
New cards

Procedural abstraction

using functions to simplify programs

37
New cards

Modularity

you separate the code into modules to make it simpler

38
New cards

Software library

a subsection of premade code that can be used 

39
New cards

APIs (application program interfaces)

explains how procedures in a library behave & can be used

40
New cards

Simulations

trying to mock a real-world abstraction or event for a specific purpose 

41
New cards

Decision problem

a problem with a yes/no answer

42
New cards

Decidable problem

for every input you will get an output 

43
New cards

Undecidable problem 

there are some inputs that you won’t get an output for

44
New cards

Optimization problem

finding ways to do things in easier ways 

45
New cards

Efficiency (CS special definition)

an estimation of the amount of computational resources used by an algorithm

  • is the algorithm efficient? does it run in a reasonable amount of time?

46
New cards

Heuristic

an approach that isn’t the best option but should be used so things don’t take an unseasonable amount of time 

47
New cards

Computing device

what processes the data & can run a program 

  • e.g. computers, tablets, servers, routers, sensors 

48
New cards

Computing system

interaction of computers for a common purpose 

49
New cards

Computer network

a group of interconnected computing devices able to send & receive data 

50
New cards

Packet

a small amount of data sent over a computer network

  • each packet has metadata about the source (sender) & destination (receiver) 

51
New cards

Packet switching

  • a message sent through the internet is broken down into packets

  • the packets don’t need to be sent in order

  • the receiving device will reassemble the packets into the original message

52
New cards

Path

a sequence that directly connects 2 computing devices (the sender & the receiver)

53
New cards

Data streams

the flow of data as packets 

54
New cards

Router

a computing device used for routing

55
New cards

Routing

the process of finding a path from the sender to the receiver 

  • no predetermined paths, the router decides the best path on the spot

56
New cards

Scalability

the capacity for a system to change in size & scale to meet new demands

  • the Internet is scalable 

57
New cards

Bandwidth

the max amount of data that can be sent in a set amount of time (bits per second) 

58
New cards

Protocol

rules that specify the behavior of a system

  • e.g. IP, TCP, UDP 

  • the protocols used on the internet are open, this means data transmission between different devices are standardized

59
New cards

The Internet

a computing network made up of interconnected networks that uses standardized & open protocols 

  • a computing device can gain access to the internet by connecting to a device already connected it 

60
New cards

World Wide Web (WWW)

a system of linked pages, programs & files; you need to enter the internet to use it 

61
New cards

HTTP

a protocol used by the WWW to transfer data between a browser & server 

62
New cards

Fault tolerance

a system can support failures & still continue to function 

63
New cards

Redundancy

inclusion of extra components to mitigate failure if other components fail 

  • network redundancy: more than 1 path between 2 devices 

  • related to fault tolerance 

64
New cards

Computational model

types of programs 

  • e.g. Sequential Computing, Parallel Computing, Distributed Computing 

65
New cards

Sequential computing

runs everything in order, one at a time 

  • e.g. Task A: 50 ms -> Task B: 60 ms 

  • B is performed after A is finished 

  • total time: 110 ms 

66
New cards

Parallel computing

when the program is divided & runs 2 programs at the same time 

  • can increase efficiency 

  • depends on the slowest program 

  • e.g. Task A: 50 ms, Task B: 60 ms 

  • A & B are performed at the same time 

  • total time: 60 ms 

67
New cards

Distributed computing

parts of the program are run on different computers 

  • used if one computer can’t handle the program (too slow/not enough storage) 

68
New cards

Digital divide

differing access to computing devices & the internet

  • based on socioeconomic, geographic, and demographic characteristics 

69
New cards

Computing bias

can reflect existing human biases because biases are written into algorithms or biases in the data used by the innovation 

70
New cards

Citizen science

public involvement in scientific research, data collection, analysis, & interpretation 

71
New cards

Crowdsourcing

gathering data from the general public 

  • e.g. survey

72
New cards

Intellectual property

work or invention that is the result of creativity to which one has rights 

73
New cards

Creative Commons

provides free licenses that you can use to tell others what they can/can’t do with your intellectual property 

74
New cards

Open source

source code is open, refers to programs people can redistribute & edit

75
New cards

Open access

online research output free of restrictions on access & use

  • no copyright or license restrictions 

76
New cards

PII (Personally Identifiable Information)

any/all personal information 

  • e.g. social security number, age, race, phone number, etc. 

77
New cards

Authentication measures

protect devices & information from unauthorized access 

  • e.g. strong passwords 

78
New cards

Multifactor authentication

requiring at least 2 steps to unlock any protected information 

79
New cards

Encryption

the process of encoding data to prevent unauthorized access

80
New cards

Symmetric encryption

1 key is used to both encrypt & decrypt data 

  • both the sender & recipient need to have this key to secure and access the data 

81
New cards

Asymmetric encryption

uses 2 keys, the public for encrypting, & private for decrypting 

  • sender doesn’t need receiver’s private key to encrypt 

  • receiver's private key is required to decrypt 

82
New cards

Decryption

the process of decoding data 

83
New cards

Digital certificates

validate the ownership of encryption keys used in secure communications

  • based on a trust model 

84
New cards

Computer virus

a type of malware that can infect & replicate itself within a computer system  

85
New cards

Malware

malicious software developed by hackers 

  • to steal data & damage/destroy computers/computer systems 

86
New cards

Phishing

tricking people into giving personal information 

87
New cards

Keylogging

a type of malware that records the keystrokesa user types on a keyboard 

  • used to steal sensitive information (passwords, credit card details) 

88
New cards

Rogue access point

a wireless network that can give unauthorized access to secure networks 

89
New cards

Relational operators

== | < | <= | > | >=

90
New cards

Logic operators

AND, OR, NOT

91
New cards

Conditional statements

if statement

92
New cards

Algorithm

sequence of steps

93
New cards

Iteration

loops (e.g. while, for)

94
New cards

Data abstraction

simplifying data into variables & lists

95
New cards

List traversal

the process of accessing each item in a list, one after the other

96
New cards

Procedural abstraction

simplifying code by putting it into functions

97
New cards

Procedure

function