AP CSP Unit 2 Vocabulary Terms

studied byStudied by 1 person
0.0(0)
Get a hint
Hint

Flow Pattern

1 / 36

flashcard set

Earn XP

37 Terms

1

Flow Pattern

A pattern that comes when data is converted by computational logic structures.

New cards
2

Sequential Execution

Instructions for a program that are executed one step at a time in its assigned order.

New cards
3

Parameter

a variable that defines a procedure or sets the conditions of an operation

New cards
4

Arguments

An actual value passed down to a function/procedure when called.

New cards
5

Procedure

A group of reusable and abstracted step-by-step instructions.

New cards
6

Comments

Annotations of a code during a program that usually indicate the purpose of source code.

New cards
7

Remix

The process of modifying and sharing a pre-existing programming project.

New cards
8

Selection

A type of algorithm where multiple courses of action can be taken based on conditions (such as if/then statements).

New cards
9

If-statements

A selection statement that is executed when a certain criteria of a conditional is met.

New cards
10

If-else statement

A more detailed version of an if-statement that lists the instructions for if the criteria of a conditional is not met.

New cards
11

Nested Conditional

A conditional that includes multiple conditionals within it.

New cards
12

Operators

Characters or symbols that represent mathematical or logical processes.

New cards
13

Control Flow

The path that a computer takes to execute a procedure in a program.

New cards
14

Branching

An instruction in a program that can cause a computer to start a different set of instructions.

New cards
15

Conditionals

A statement that executes (or returns a value) when a certain criteria or condition is met.

New cards
16

Boolean Value

0s and 1s that return to indicate whether a statement is true (1) or false (0).

New cards
17

Switching

Returning different 0 or 1 values based on if a statement is true or false.

New cards
18

Nesting

Adding if statements within another if-statement.

New cards
19

Iteration

A type of algorithm which uses repetition of a number of actions until a condition is met.

New cards
20

Loop

A line of code that repeats other lines of code, which is used for iteration algorithms.

New cards
21

Indefinite Loop

A loop that will run an infinite number of times until another event in the code occurs (ex

New cards
22

Definite Loop

A loop that will iterate based on how many times the programmer tells it to iterate.

New cards
23

Repetition

A written step of a loop repeated until a condition is met.

New cards
24

Unsolvable Problem

A problem that cannot be solved by any algorithm

New cards
25

Halting Problem

A problem that determines whether a program will terminate or run indefinitely.

New cards
26

Scalability

How well programs execute on a progressively larger scale.

New cards
27

Big-O Notation

A mathematical notation that determines how much time and space a program needs as the input increases.

New cards
28

Sequential Search

A search that checks every value of a list until the result is found.

New cards
29

Binary Search

A search that divides a portion of a list by half until the result is identified.

New cards
30

Logarithmic Behavior

doubling the size of a problem only requires one extra unit of work.

New cards
31

Moore’s Law

States that the number of transistors in a chip will double every 1-2 years. This law helps to predict computer efficiency and developments.

New cards
32

Heuristics

Techniques designed for faster problem-solving for a complex issue.

New cards
33

operator block

light-green colored blocks of code used to handle strings and math equations in Scratch.

New cards
34

undecidable problem

where no algorithm can be made that always leads to a correct yes or no answer.

New cards
35

if-block

a set of instructions within an if block that is executed only if the condition in the if statement is met.

New cards
36

logic gate

a hardware abstraction that is modeled by a Boolean function

New cards
37

brute forcing

trial and error method used to decode encrypted data such as passwords.

New cards

Explore top notes

note Note
studied byStudied by 279 people
... ago
5.0(1)
note Note
studied byStudied by 72 people
... ago
4.0(1)
note Note
studied byStudied by 66 people
... ago
5.0(4)
note Note
studied byStudied by 38 people
... ago
5.0(2)
note Note
studied byStudied by 21 people
... ago
5.0(1)
note Note
studied byStudied by 40096 people
... ago
4.8(312)

Explore top flashcards

flashcards Flashcard (25)
studied byStudied by 7 people
... ago
5.0(1)
flashcards Flashcard (23)
studied byStudied by 5 people
... ago
4.0(1)
flashcards Flashcard (58)
studied byStudied by 13 people
... ago
5.0(2)
flashcards Flashcard (26)
studied byStudied by 4 people
... ago
5.0(1)
flashcards Flashcard (25)
studied byStudied by 7 people
... ago
5.0(1)
flashcards Flashcard (28)
studied byStudied by 2 people
... ago
4.0(4)
flashcards Flashcard (33)
studied byStudied by 80 people
... ago
5.0(3)
flashcards Flashcard (79)
studied byStudied by 12 people
... ago
5.0(1)
robot