AP CSP Chapter 2 Vocab

abstraction

The separation of the high-level view of an entity from the low-level details of its implementation

Algorithm discovery

The process of finding an algorithmic solution to a given problem.

computation

An algorithmic operation that carries out a single numeric computation and stores the result.

conditional statements

Operations that ask a question and select the next instruction to carry out based on the answer to that question.

Continuation condition

The true/false condition in an iterative statement that will determine when the iteration has been completed

Control operations

Operations that alter the normal sequential flow of control within an algorithm.

Input

An operation that causes data values from the outside world to be brought into the algorithm.

Iteration

The repetitive execution of a block of operations.

iterative operations

Algorithmic operations that repeat a block of instructions

library

A collection of useful prewritten algorithms that can be used during problem solving

loop body

The block of statements that are to be repetitively executed

output

An operation that causes computed values to be sent to the outside world for viewing or saving.

Primitive operations

Instructions that can be directly understood by the computing agent executing the algorithm and which do not have to be further clarified or explained

pseudocode

A notation used to design algorithms. It uses English constructs, mathematical notation and an informal algorithmic structure designed to look like a high-level programming language.

sequential algorithm

An algorithm that executes its operations in a straight line, from top to bottom, without any branching.

top-down design

A problem solving strategy in which you begin at the highest level view of the problem and, in steps, address the lower-level details of how to accomplish each operation

variable

a named storage location that can hold a data value