PLTW CSE Essentials - Review for EOC - #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) 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) 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)

Front

A(n) variable is:

Back

The smallest unit of data storage that a program can use.

Front

Which Event Handler will update the Screen to show the picture taken on the Canvas?

Back

Camera 2

Front

If "AngryBird.X > HappyPig.X" is TRUE and "AngryBird.Y > HappyPig.Y" is FALSE, what color will be chosen?

Back

Green