Unit 6 - Algorithms

Question 1

Problem

Answer 1

A general description of a task that can or cannot be solved with an algorithm

Question 2

Algorithm

Answer 2

A finite set of instructions that accomplish a task

Question 3

Sequencing

Answer 3

Putting steps in an order

Question 4

Selection

Answer 4

Deciding which steps to do next

Question 5

Iteration

Answer 5

Doing some steps over and over

Question 6

Efficiency

Answer 6

A measure of how many steps are needed to complete an algorithm

Question 7

Linear search

Answer 7

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

Question 8

Binary Search

Answer 8

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

Question 9

Reasonable Time

Answer 9

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

Question 10

Unreasonable Time

Answer 10

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time

Question 11

Parallel computing

Answer 11

A model in which programs are broken into small pieces, some of which are run simultaneously