Computer Science #2

Front 1

When you declare an object...

Back 1

...the name is a memory address, or reference.

Front 2

Name the three control structures

Back 2

Sequence, selection, repetition. All three have one entry and one exit.

Front 3

In a sequence structure...

Back 3

...you perform a sequence of events, without the ability to branch off and skip any of them.

Front 4

In a selection (decision) structure...

Back 4

...you ask a question, and then take a course of action that depends on the answer.

Front 5

How many types of selection structures are there?

Back 5

Single alternative/unary (if-then), Dual alternative/binary (if-then-else), and Multiple alternative (case).

Front 6

Repetition structure

Back 6

Also known as an Iteration or Loop structure. In this structure, you ask a question, and perform the required action, then when finished, ask the question again.

Front 7

While loop/while-do loop

Back 7

In these loops, a process continues while a condition remains true.

Front 8

Stacking

Back 8

attaching structures end to end.

Front 9

Nesting

Back 9

putting a structure within another.

Front 10

do-until loop

Back 10

makes sure a procedure executes at least once, then either runs or does not run depending on the result.

Front 11

Priming read/priming input

Back 11

beginning statement in a structure.

Front 12

Block

Back 12

a group of statements that execute as a whole.

Front 13

Boolean expressions/logic

Back 13

only has two states: true or false. Boolean expressions work in the selection structure.

Front 14

Boolean operators

Back 14

are NOT,AND,OR. Boolean operators follow an order of operations that is as follows, NOT,AND,OR.
These operators create what are know as Compound conditions.

Front 15

NOT operator

Back 15

Reverses the meaning of a boolean expression. NOT is evaluated first.

Front 16

AND operator

Back 16

combines decisions so that both/all must be true for an action to occur.
AND is evaluated second (or first, if there is no NOT operator).

Front 17

OR operator

Back 17

combines decisions so that only one must be true for an action to occur. OR is evaluated last.

Front 18

Boolean orders of operations

Back 18

Parenthesis/brackets, NOT, AND, OR.

Front 19

Relational comparison operators

Back 19

symbols that express boolean operations such as =,<,>,<=,>=

Front 20

Case structure

Back 20

A convenient alternative to other structures. Allows one selection between multiple alternatives by testing a variable between several values. Replaces if-then-else structure.