PLTW CSE Essentials - 1st Semester Review for EOC

Front

A(n) abstraction is:

Back

Way to manage complexity, hide details or remove duplication

Front

A(n) algorithm is:

Back

A set of steps to accomplish a task.

Front

A(n) argument is:

Back

Values that a program provides to a function or subroutine

Front

A(n) arithmetic operator is:

Back

Type of code to perform a math operation, such as + - * /

Front

A(n) Boolean expression is:

Back

An expression that can be evaluted as TRUE or FALSE. Often used in CONDITIONAL STATEMENTS, such as IF (condition) THEN (action1) ELSE (action2)

Front

A(n) event handler is:

Back

Control block that looks for events to then perform action

Front

A(n) float is:

Back

A precise number by including values after the decimal place

Front

A(n) integer is:

Back

A whole number, it does not have any digits after a decimal.

Front

A(n) boolean is:

Back

A data type that can have only 2 values - TRUE or FALSE

Front

A(n) conditional statement is:

Back

A programming statement that directs control flow - it uses BOOLEAN expressions to make a choice between different paths (IF (condition) THEN (path1) ELSE (path2)