AP CSP Vocabulary - Fall Semester

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/143

encourage image

There's no tags or description

Looks like no tags are added yet.

144 Terms

1
New cards

Collaboration

Working with others to develop ideas, solve problems, and create or improve a computing product.

2
New cards

Computing innovation

A new or improved product, process, or idea that includes a computer or program as an essential part of how it works.

3
New cards

Diverse perspectives

Different viewpoints, experiences, and backgrounds that help a team consider more ideas and user needs.

4
New cards

Bias

A tendency or assumption that favors certain people, groups, or outcomes and may lead to unfair or inaccurate results.

5
New cards

Pair programming

Two people programming together: the driver writes code while the navigator reviews and guides. They switch roles.

6
New cards

Program

A collection of instructions that a computer executes to perform tasks.

7
New cards

Code segment

A portion of a program containing one or more instructions.

8
New cards

Program purpose

The reason a program exists, such as solving a problem, supporting creativity, or meeting a need.

9
New cards

Program functionality

What a program does when it runs, including its actions and responses to input.

10
New cards

Input

Data supplied to a program, such as a button click, typed response, sensor reading, or file.

11
New cards

Output

Data or results a program produces, such as displayed text, sound, or a saved file.

12
New cards

Event

An occurrence that a program can detect and respond to, such as a mouse click or key press.

13
New cards

Event-driven programming

Programming in which events trigger particular sections of code to execute.

14
New cards

Development process

The activities involved in creating and improving a program, including investigation, design, implementation, and testing.

15
New cards

Iterative development

Repeatedly reviewing, testing, and revising a program to improve it.

16
New cards

Incremental development

Building a program in smaller parts, adding and testing functionality as development continues.

17
New cards

Investigation

Examining a problem, its context, and users' needs before deciding on a solution.

18
New cards

Design

Planning a program's behavior, interface, data, and algorithms.

19
New cards

Implementation

Turning a design into working program code.

20
New cards

Testing

Running a program with selected inputs and checking whether its behavior matches what was intended.

21
New cards

User interface

The parts of a program through which a user interacts with it, such as buttons, menus, and text fields.

22
New cards

Documentation

Written descriptions explaining a program's purpose, development, operation, or use.

23
New cards

Comments

Explanatory notes within code that are not executed as program instructions.

24
New cards

Syntax error

A mistake that breaks the rules of a programming language, such as a missing required symbol.

25
New cards

Logic error

A mistake in a program's steps or reasoning that causes an incorrect result or behavior.

26
New cards

Runtime error

An error that occurs while a program executes, such as accessing an invalid list index.

27
New cards

Overflow error

An error caused by attempting to represent a number outside the range a computer's numeric representation supports.

28
New cards

Debugging

Finding and correcting errors in a program.

29
New cards

Test case

A specific input or set of conditions used to check a program's behavior, usually with an expected result.

30
New cards

Expected output

The result a correctly working program should produce for a particular input.

31
New cards

Bit

A single binary digit: either 0 or 1.

32
New cards

Byte

A group of eight bits.

33
New cards

Binary

A base-2 number system that uses only the digits 0 and 1.

34
New cards

Decimal

A base-10 number system that uses the digits 0 through 9.

35
New cards

Binary sequence

An ordered arrangement of bits used to represent data or instructions.

36
New cards

Digital data

Data represented using separate, distinct values; computers store it as bits.

37
New cards

Analog data

Data represented by continuously changing values, such as the air pressure changes in a sound wave.

38
New cards

Sampling

Measuring an analog signal at selected points to create a digital representation.

39
New cards

Abstraction

Reducing complexity by focusing on important features while hiding unnecessary details.

40
New cards

Overflow

The situation in which a number exceeds the range that can be represented with the available bits.

41
New cards

Round-off error

A difference between an exact value and its stored approximation caused by limited numeric precision.

42
New cards

Data compression

Reducing the number of bits needed to represent data.

43
New cards

Lossless compression

Compression that allows the original data to be reconstructed exactly.

44
New cards

Lossy compression

Compression that discards some information, so the original data cannot always be reconstructed exactly.

45
New cards

Redundancy

Repeated or predictable information that compression methods can often represent more compactly.

46
New cards

Data

Recorded values, observations, or measurements that can be stored and processed.

47
New cards

Information

Meaning or understanding obtained by organizing, processing, or interpreting data.

48
New cards

Metadata

Data describing other data, such as a file's author, creation date, or location.

49
New cards

Correlation

A relationship in which two variables tend to change together; it does not establish that one causes the other.

50
New cards

Causation

A relationship in which a change in one factor produces a change in another.

51
New cards

Data visualization

A visual representation of data, such as a chart, graph, or map, that helps reveal relationships or patterns.

52
New cards

Data set

A collection of related data values or records.

53
New cards

Data processing

Performing operations on data to organize, change, analyze, or extract information from it.

54
New cards

Data cleaning

Identifying and addressing errors, duplicates, missing values, or inconsistent formats in data.

55
New cards

Filtering

Selecting only the data that meets specified conditions.

56
New cards

Transforming data

Changing data's format, structure, or values to make it useful for a task.

57
New cards

Combining data

Bringing together data from multiple sources or data sets for use or analysis.

58
New cards

Patterns

Repeated structures, similarities, or relationships found in data.

59
New cards

Trends

General directions of change in data, often over time.

60
New cards

Variable

A name associated with a stored value that a program can access or change.

61
New cards

Assignment

Storing a value in a variable, replacing its previous value if it had one.

62
New cards

Assignment operator

The symbol that assigns a value to a variable; AP pseudocode uses ←.

63
New cards

Value

A particular piece of data, such as 12, true, or "hello".

64
New cards

Data type

A category of values that determines how those values can be used, such as numbers, Booleans, or strings.

65
New cards

Integer

A number without a fractional part, such as -3, 0, or 14.

66
New cards

Real number

A numeric value that may have a fractional part, such as 3.5 or -0.25. Computers may store approximations of these values.

67
New cards

Boolean

A data type with only two possible values: true and false.

68
New cards

String

An ordered sequence of characters representing text, such as "Computer Science".

69
New cards

Data abstraction

Managing complexity by organizing data so a program can use it without handling every underlying detail separately.

70
New cards

List

An ordered collection of elements stored under one name.

71
New cards

Element

An individual item in a list.

72
New cards

Index

A number identifying an element's position in a list. AP pseudocode starts indexing at 1.

73
New cards

List length

The number of elements in a list.

74
New cards

Algorithm

A precise sequence of steps for completing a task or solving a problem.

75
New cards

Sequencing

Executing instructions in a specified order.

76
New cards

Expression

A combination of values, variables, operators, or procedure calls that evaluates to a value.

77
New cards

Arithmetic operator

A symbol that performs a mathematical operation, such as +, -, *, or /.

78
New cards

Order of operations

Rules determining which operations in an expression are performed first.

79
New cards

MOD

An operator that gives the remainder after division; for example, 17 MOD 5 is 2.

80
New cards

String concatenation

Joining strings together to create a longer string.

81
New cards

Substring

A consecutive sequence of characters within a string.

82
New cards

Boolean expression

An expression that evaluates to either true or false.

83
New cards

Relational operator

An operator that compares values, such as =, ≠,

84
New cards

Logical operator

An operator that combines or changes Boolean values, such as AND, OR, or NOT.

85
New cards

AND

Produces true only when both conditions are true.

86
New cards

OR

Produces true when at least one condition is true, including when both are true.

87
New cards

NOT

Reverses a Boolean value: true becomes false, and false becomes true.

88
New cards

Selection

Choosing which instructions execute based on whether a condition is true or false.

89
New cards

Condition

A Boolean expression used to control a decision or repetition.

90
New cards

Conditional statement

A statement that determines which code executes based on a condition.

91
New cards

IF statement

Executes a block of code when its condition is true; otherwise, that block is skipped.

92
New cards

IF-ELSE statement

Executes one block when a condition is true and a different block when it is false.

93
New cards

Nested conditional

A conditional statement placed inside another conditional statement.

94
New cards

Iteration

Repetition of a set of instructions; one iteration is one execution of the repeated instructions.

95
New cards

Loop

A programming structure that repeats a block of code.

96
New cards

Infinite loop

A loop that continues indefinitely because its stopping condition is never reached or no stopping mechanism exists.

97
New cards

REPEAT n TIMES

A loop that executes its body a specified number of times.

98
New cards

REPEAT UNTIL

A loop that continues while its condition is false and stops when it becomes true. In AP pseudocode, the condition is checked before each iteration.

99
New cards

Pseudocode

A way of describing an algorithm using readable, code-like instructions without requiring a particular programming language.

100
New cards

Flowchart

A diagram using shapes and arrows to show an algorithm's steps, decisions, and flow of execution.