Unit 6 Review

Define the word Algorithm.

• a pattern of beats

• a field of mathematics in which some numbers are replaced by variables

• a multi-layered pasta dish

• a finite set of instructions that accomplish a task.

How does a Binary Search work?

• Cut an ordered list in half then check if the given number is greater to or less than the number found. Repeat until the given number is found.

• Start your search at the beginning of an ordered list and check each item in order until the given number is found.

• Check the numbers at the beginning and end of an ordered list. Continue the search at whichever end has a value closest to the given number.

• First, divide an ordered list into four different sub-lists. Then search each one for the given number.

Define Efficiency.

• the measure of an algorithm's effectiveness.

• a measure of how many steps are needed to complete an algorithm.

• the ability of an algorithm to find any given number in an ordered list.

• a quality of algorithms that are easy to use

• exponential

• linear

• logarithmic

• polynomial

• exponential

• linear

• logarithmic

• polynomial

What is an algorithm that runs in "reasonable" time?

• Algorithms with efficiency of exponential order

• Algorithms with efficiency of polynomial order or lower

• Algorithms with constant efficiency only

• Algorithms that listen to your side without passion or judgment

What is an algorithm that runs in "unreasonable" time?

• Algorithms that won't listen to you and are never open to new information

• Algorithms that always show up late, even when you tell them to show up an hour earlier.

• Algorithms with factorial or exponential efficiency

• Algorithms that never increase in time, no matter how big the number of items is.

What sort of solutions do Heuristic algorithms provide?

• "perfect" through brute force

• "optimal" through neural net AI

• "inefficient" by picking a random order and sticking with it

• "good enough" through guessing and learning

What is an "undecidable" problem?

• a problem for which no algorithm can always provide a definite yes or no answer

• a problem choosing which ice cream flavor to get at Baskin Robins

• a problem in which each potential solution has the exact same value

• A problem in which a random choice is just as good any other.