AP CS Exam 2 Review

the direction the computer program moves from instruction to instruction over time.

an annotation in the code of a computer program is called commenting.

doubling the size of a problem only requires one extra unit of work.

a method of searching by dividing the search interval in half each time is called sequential search?

a special type of variable used within a procedure.

a more thorough version of an if statement that stipulates what is to happen when a certain criteria is not met.

There cannot be a program that will determine which computer programs will halt and which programs will go on forever.

a mathematical concept used by computer scientists to determine how well algorithms scale.

symbols that imply a comparison in conditional selection statements.

repetition - one complete step of a loop, repeated until a certain condition is met

how well do algorithms perform at increasingly larger scales is called scalibilty.

Moores Law was developed by:

Nesting is where different logic structures sequence, selection and loops are combined or nested in one another.

a collection of statements that performs a specific task when run by a computer.

a named collection of steps in an algorithm that can be reused anytime it is needed without restating the procedures.

type of selection statement that only executes when a certain criteria is met.

to modify and share a version of an uploaded existing project

a named collection of steps in an algorithm (or group of programming instructions) that can be reused anytime.

pattern that can emerge when data is transformed using computational logic structures (sequencing, selection, iteration)

a method for deriving an approximate solution - Rules of Thumb but not guaranteed an accurately correct answer

the repetition of some code is called loops.

where no algorithm can be made that always leads to a correct yes or no answer.

A hardware abstraction that is modeled by a Boolean function.

a process or set of rules to be followed in calculations or other problems solving operations

algorithmic structure that uses "if...then" to tell the computer how to select a step or sequence.

light-green colored blocks of code used to handle strings and math equations in Scratch.

When it is unknown how many times a loop will iterate.

logic structure where instructions are executed in order, one after another, one at a time. Often called linear.

an informal method of writing algorithmic instructions that do not follow grammatical rules of a particular language.

trial and error method used to decode encrypted data such as passwords is called brute forcing.

a linear search method of finding a targeted value within a list, looking one at a time until a match is found.

refers to a collection of program statements that are part of a program.

a simple diagram with symbols showing the "flow" of a process

a set of instructions within an if block that is executed only if the condition in the if statement is met.

Moore's Law accurately predicted that the number of transistors that could fit on a chip would roughly _____ every year

How confident are you about the test Thursday?

program instructions that are executed one at a time, in order.

a variable that defines a procedure or sets the conditions of an operation

executes a predetermined set of times for a loop to be repeated

instruction in a computer program that can cause a computer to begin executing a different sequence of instructions.