PLTW CSE Flashcard - Activities 1.1.1 thru 1.1.3

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) relational operator is:

Back

A symbol that represents a compare action for a computer to take. Examples are: ">" (greater than), "<" (less than) and "=" (equal)

Front

A(n) event handler is:

Back

Control block that looks for events to then perform action

Front

A(n) logical operator is:

Back

Operators that are used to combine or change Boolean Expressions. The 3 standard operators are AND, OR, and NOT.

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.