Unit 10 - Algorithms Vocabulary

Front

Fill in the blank: A general description of a task that can (or cannot) be solved with an algorithm is called a _______.

Back

Problem

Front

Fill in the blank: A finite set of instructions that accomplish a task is called an _______.

Back

Algorithm

Front

Fill in the blank: Putting steps in an order is called _______.

Back

Sequencing

Front

Deciding which steps to do next is called _______.

Back

Selection

Front

Fill in the blank: Doing some steps over and over is called _______.

Back

Iteration

Front

A measure of how many steps are needed to complete an algorithm is called _______.

Back

Efficiency

Front

Fill in the blank: A search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked is called _______.

Back

Linear Search

Front

A search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated is called _______.

Back

Binary Search

Front

Fill in the blank: Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a _______ amount of time.

Back

Reasonable

Front

Fill in the blank: Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an _______ amount of time.

Back

Unreasonable