Row 1
What is an algorithm?
Is a finite set of instructions that accomplish a task.
Define a problem.
A general description of a task that can (or cannot) be solved with an algorithm
Define sequencing.
Putting steps in an order.
Define a Heuristic.
Something that provides a "good enough" solution to a problem when an actual solution is impractical or impossible (unreasonable or undecidable).
Define iteration.
Repeating steps over and over again.
Define selection.
Deciding which steps to do next.
Is a linear Graph efficient or not? What kind of raffle does it produce?
Reasonable; Normal raffle.
Define a Decision problem.
A problem with a yes or no answer.
Define Parallel Computing.
A model in which programs are broken into small pieces, some of which are run simultaneously
Define Speedup.
The time used to complete a task sequentially divided by the time to complete the task in parallel
Define Linear Search
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
Define Binary Search
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 a polynomial Graph efficient or not? What kind of raffle does it produce?
Reasonable; Pair raffle.
Define an Optimization Problem.
A problem with the goal of finding the "best" solution among many.
Define a simulation.
Programs which replicate or mimic key features of a real world event in order to investigate its behavior without the cost, time, or danger of running an experiment in real life.
How do sequencing, selection, and iteration help make up algorithms?
Together, they allow for the creation of complex procedures to solve problems efficiently.
Which search is more efficient with large data sets?
Binary search is much more efficient with large datasets than the linear search.
Is a exponential Graph efficient or not? What kind of raffle does it produce?
Unreasonable; Group raffle.
Define Sequential Computing
Programs run in order, one command at a time.
Define Efficiency
A measure of how many steps are needed to complete an algorithm
Define unreasonable Time.
Algorithms with exponential or factorial efficiencies.
Define Reasonable Time.
Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.).
What is an Undecidable Program?
Problems for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.
Define Distributed Computing.
A model in which programs are run by multiple devices
Is a log Graph efficient or not? What kind of raffle does it produce?
Reasonable; Sorted raffle.