AP CSP 9 - Further Computer Science Concepts

Front

empirical analysis

Back

A way to test an algorithm with a variety of inputs to observe what the program does.

Front

instance

Back

This part of a problem includes specific input.

Front

efficiency

Back

In the sense of an algorithm, this is an estimate of how much computational power an algorithm takes up.

Front

linear search

Back

A method for finding an element within a list by examining each item one by one.

Front

binary search

Back

In this search, data is cut in half and cut in half again until the item is found. For organized data, this type of searching is faster.

Front

run time

Back

The amount of time an algorithm takes to fully execute.

Front

decidable problem

Back

Problems that have a definite answer.

Front

undecidable problem

Back

A problem that does not have a solution.

Front

optimization problem

Back

A problem that looks for the best possible answer.

Front

heuristic

Back

A strategy that helps to quickly come to a good answer.