Algorithms Solve Problems
Algorithm Efficiency
Unreasonable Time
The Limits of Algorithms
Parallel and Distributed Algorithms
100

A finite set of instructions that accomplish a task

What is algorithms?

100

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

What is Efficiency?

100

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

What is reasonable time?

100

Provides a "good enough" solution to problem when an actual solution is impractical or impossible

What is a Heuristic?

100

Programs are broken into small pieces, some of which are run simultaneously.

What is Parallel Computing?

200

Putting steps in order

What is sequencing?

200

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.

What is Linear Search?

200

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

What is unreasonable time?
200

A problem for which no algorithm can be constructed that is always capable of providing a correct yes or no answer.

What is an Undecidable Problem?

200

The time used to complete a task sequentially divided by the time to complete a task in parallel.

What is speedup?

300

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

What is a Problem

300

 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.

What is Binary Search?

300

The amount of checks it will take in a pair raffle if there are 10 tickets

What is 100?


300

What you need to know to take the best path in the traveling salesman problem.

What is Distance?

300

The speedup if a sequential time takes 60 seconds and the parallel time takes 40 seconds.

What is 1.5?

400

Doing steps over and over withing an algorithms

What is Iteration?

400

The amount of steps it would take in a binary Search if there are 15 inputs.

What is 4?

400

This type of raffle is very unreasonable to do.

What is exponential/group raffle?

400

A famous problem that is an example that algorithms can't solve all problems. 

What is the Halting Problem?

400

Programs are run by multiple devices

What is distributed Computing?

500

What shape does this make?

REPEAT 2 TIMES

{

    MOVE_FORWARD()

    MOVE_FORWARD()

    TURN_RIGHT()

    MOVE_FORWARD()

    TURN_RIGHT()

}

What is a Rectangle?

500

The amount of steps it would take in a linear search if there was 100 inputs.

What is 100?

500

This is the most reasonable type of raffle.

What is log/sorted raffle

500

The number of steps to check for the best path to visit 5 houses.

What is 120?

500

The parallel time if the sequential time is 100 seconds and the speed up is 2.5

What is 40 seconds?