APCSP final vocab review

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

1/160

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 11:52 PM on 3/24/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

161 Terms

1
New cards

Collaboration

People working together and sharing ideas to create or improve a program.

2
New cards

Program documentation

Written notes that explain what a program or code segment does and how to use it.

3
New cards

Comments

Notes inside code meant for humans, ignored by the computer, explaining how or why the code works.

4
New cards

Program

A set of instructions a computer follows to complete a task.

5
New cards

Software

Programs that run on hardware devices.

6
New cards

Program purpose

The overall goal or problem the program is meant to solve.

7
New cards

Program function

The specific behavior or task the program actually performs (what it does with inputs and outputs).

8
New cards

Program requirements

The conditions or features a program must have to meet the user’s needs.

9
New cards

Event

An action that triggers code, like a mouse click or key press.

10
New cards

Program inputs

Data sent into a program for it to process (clicks, text, sensor data, etc.).

11
New cards

Program outputs

Data a program sends out, like text on screen, sounds, or lights.

12
New cards

Code segment

A small part of a program, such as a few lines or a function.

13
New cards

Designing

Planning what a program should do and how it will be structured before fully coding it.

14
New cards

Iterative development

Improving a program through repeated cycles of coding, testing, and revising.

15
New cards

Incremental development

Building a program in small pieces, adding and testing a bit at a time.

16
New cards

Diagramming

Using diagrams to plan how parts of a program fit together.

17
New cards

Prototyping

Making a simple early version of a program or interface to test ideas.

18
New cards

Testing

Running a program with different inputs to check if it works correctly.

19
New cards

Debugging

Finding and fixing errors in code so the program behaves as intended.

20
New cards

Flow chart diagrams

Diagrams that show the steps and decisions in an algorithm using arrows and boxes.

21
New cards

User testing

Having real users try the program and give feedback to improve it.

22
New cards

Logic error

Code that runs but produces the wrong result because the algorithm is wrong.

23
New cards

Syntax error

A mistake in code rules (like missing parentheses) that stops the program from running.

24
New cards

Run-time error

An error that occurs while the program is running, such as dividing by zero.

25
New cards

Overflow error

An error when a number is too large to store in the available bits.

26
New cards

Round-off error

Small inaccuracy when a number cannot be represented exactly in binary.

27
New cards

Hand tracing

Simulating code by hand, line by line, to track variable values and outputs.

28
New cards

Output statements

Lines of code that display or send data out (like print statements).

29
New cards

Test cases

Specific sets of inputs and expected outputs used to check correctness.

30
New cards

Abstraction

Hiding details to focus on the main idea, like representing a song as a file instead of all its voltages.

31
New cards

Analog data

Continuous data (like real sound waves or light) that can take any value in a range.

32
New cards

Sampling technique

The way analog data is measured at regular intervals to create digital data.

33
New cards

Samples

Individual measurements taken from analog data at specific times.

34
New cards

Bit

The smallest unit of data, a 0 or 1.

35
New cards

Byte

A group of 8 bits.

36
New cards

Binary (base-2)

Number system that uses only 0 and 1.

37
New cards

Hexadecimal (base-16)

Number system that uses 0–9 and A–F to represent values.

38
New cards

Data compression

Reducing the size of data so it uses fewer bits.

39
New cards

Lossless data compression

Compression that lets you perfectly reconstruct the original data.

40
New cards

Lossy data compression

Compression that loses some detail but makes the file much smaller.

41
New cards

Information

Data that has been processed or given context so it is meaningful.

42
New cards

Metadata

Data about data, like the file size or date of a photo.

43
New cards

Data bias

When data collected or used is unbalanced or unfair, leading to biased conclusions.

44
New cards

Cleaning data

Fixing or removing wrong, duplicate, or missing data before analysis.

45
New cards

Correlation

When two variables appear to change together (but one does not necessarily cause the other).

46
New cards

Transforming data

Changing data format or structure to make it easier to analyze.

47
New cards

Filtering data

Keeping only the data that matches certain conditions.

48
New cards

Combining data

Joining multiple data sets together.

49
New cards

Visualizing data

Showing data with charts, graphs, or maps to see patterns.

50
New cards

Variable

A named storage location that can hold a value that may change.

51
New cards

Data types

Categories of data like number, Boolean, string, list, etc.

52
New cards

Assignment operator

Symbol (like =) that stores a value into a variable.

53
New cards

Data abstraction

Using collections (like lists) to manage complex data more simply.

54
New cards

List

An ordered collection of elements, referenced by index.

55
New cards

Element

An individual item stored in a list.

56
New cards

Index

The position of an element in a list (AP uses 1-based in pseudocode).

57
New cards

String

A sequence of characters (letters, digits, symbols).

58
New cards

Array

Another term for a list-like collection indexed by position.

59
New cards

Algorithm

A finite set of steps that accomplish a specific task.

60
New cards

Sequencing

Running steps in order, one after another.

61
New cards

Code statement

A single instruction in a program.

62
New cards

Expression

A combination of values, variables, and operators that produces a result.

63
New cards

Relational operators

Operators like

64
New cards

Modulo operator

Operator that gives the remainder after division (like 7 mod 3 = 1).

65
New cards

String concatenation

Joining two strings end-to-end.

66
New cards

Substring

A smaller string taken from part of a larger string.

67
New cards

Boolean value

A value that is either true or false.

68
New cards

NOT operator

Flips a Boolean value from true to false or false to true.

69
New cards

AND operator

True only if both conditions are true.

70
New cards

OR operator

True if at least one condition is true.

71
New cards

Selection

Using conditions to decide which code path to run (if/else).

72
New cards

Conditional statement

A statement that runs code only if a condition is true.

73
New cards

IF statement

Runs code when a condition is true.

74
New cards

ELSE statement

Runs alternate code when the IF condition is false.

75
New cards

Nested conditionals

An IF/ELSE inside another IF/ELSE.

76
New cards

Iteration

Repeating steps using loops.

77
New cards

FOR loop

Loop that repeats a set number of times or over each element in a list.

78
New cards

WHILE loop

Loop that repeats while a condition remains true.

79
New cards

List traversal

Visiting each element in a list, often using a loop.

80
New cards

Linear search

Checking each element in a list one by one until you find a match.

81
New cards

Binary search

Repeatedly splitting a sorted list in half to find a value faster.

82
New cards

Procedure

A named block of code that performs a specific task.

83
New cards

Method / function

Another name for a procedure that can return a value.

84
New cards

Procedure call

Code that runs a procedure by name.

85
New cards

Parameter

A variable in the procedure definition that accepts input.

86
New cards

Argument

The actual value passed into a parameter when calling a procedure.

87
New cards

Return statement

Statement that sends a value back from a function and ends it.

88
New cards

Procedural abstraction

Using procedures to hide how something works and just call it by name.

89
New cards

Modularity

Breaking a program into separate, reusable pieces (modules).

90
New cards

Software libraries

Collections of prewritten procedures you can call in your program.

91
New cards

APIs: Application Programming Interfaces

Descriptions of library procedures and how to call them.

92
New cards

Simulation

A program that models a real or imagined system to study its behavior.

93
New cards

Random number generators (RNG)

Tools that generate pseudo-random values for simulations or games.

94
New cards

Problem

A task or question you want a program or algorithm to solve.

95
New cards

Instance

A specific example or input of a general problem.

96
New cards

Decision problem

A problem whose answer is yes/no.

97
New cards

Optimization problem

A problem that asks for the “best” solution under some rules.

98
New cards

Algorithmic efficiency

How well an algorithm uses time and space as input size grows.

99
New cards

Reasonable time

Grows at a manageable rate (like polynomial time) as input increases.

100
New cards

Unreasonable time

Grows too fast (like exponential) to run for large inputs.