Midterm 2

Front 1

repetition structure

Back 1

causes a statement or set of statements to repeat

Front 2

another name for repetition structure is

Back 2

a loop

Front 3

condition-controlled loops

Back 3

uses true/false conditions to control the number of times the loop repeats

Front 4

the 3 different condition-controlled loops

Back 4

while, do while, do until

Front 5

pre-test loop

Back 5

while loop executes its condition before performing another loop

Front 6

posttest loop

Back 6

do while, do until will execute conditions after a loop

Front 7

infinite loop

Back 7

repeats until something causes it to interrupt it due to not having a programmed condition to stop it

Front 8

count- controlled loops

Back 8

loops a specific number of times

Front 9

decision structure

Back 9

allows a program to perform actions only under certain conditions

Front 10

If-then

Back 10

single alternative decision structure

Front 11

relational operators

Back 11

>, <, >==, <==, ==, !=

Front 12

Boolean expressions

Back 12

expressions that are either true or false

Front 13

dual alternative decision structure

Back 13

has 2 paths of possible execution depending on whether the condition is true or false (if-then-else)

Front 14

nested decision structure

Back 14

a decision structure can be nested inside another decision structure

Front 15

logical operators

Back 15

AND, OR, NOT

Front 16

AND

Back 16

true when both statements are true

Front 17

OR

Back 17

true when either expression is true

Front 18

NOT

Back 18

reverses a statements logical value and returns false

Front 19

Boolean variables

Back 19

hold one of two values: true or false

Front 20

How do count-controlled loops work

Back 20

initialization, test, and increment

Front 21

For loop

Back 21

count- controlled

for counterVariable = startingValue TO maxValue

statement

statement

statemnet

End For

Front 22

decrement

Back 22

to decrease the value of the variable in a For loop

Front 23

accumulator

Back 23

keeps a running total

Front 24

sentinel

Back 24

special value that marks the end of a list of values

Front 25

nested loop

Back 25

loop in a loop

Front 26

function

Back 26

module that returns a value

Front 27

library functions

Back 27

pre-written functions in most programming languages

Front 28

Random (1, 100)

Back 28

generates a random number between 1-100

Front 29

abs (n)

Back 29

absolute value

Front 30

sqrt (n)

Back 30

square root

Front 31

IPO chart

Back 31

input, processing, output. helps with designing a program

Front 32

garbage in, garbage out

Back 32

the idea that if a program reads bad data as input, it will output bad data. programs should be designed to reject bad data

Front 33

input validation

Back 33

commonly done with a loop that iterates as long as an input variable contains bad data

Front 34

process of input validation

Back 34

get data, is input invalid, display error message, ask for data again,

Front 35

defensive programming

Back 35

practice of anticipating errors that can happen while a program is running and therefore designing the program to avoid those errors