Category 1
Category 2
Category 3
Category 4
Category 5
100
a general description of a task that can (or cannot) be solved with an algorithm
What is a problem?
100
Doing some steps over and over.
What is iteration?
100
a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data.
What is Binary Search?
100
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?
100
programs are run by multiple devices.
What is Distributed Computing?
200
Putting steps in an order
What is sequencing?
200
Deciding which steps to do next.
What is selection?
200
Algorithms with a polynomial efficiency or lower are said to run in:
What is Reasonable Time?
200
programs run in order, one command at a time.
What is Sequential?
200
Name one of the many ways to write or express one algorithm
What is pseudocode, diagram, natural language or code.
300
a finite set of instructions that accomplish a task.
What is an algorithm?
300
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 a Linear Search?
300
For every new place to visit, the number of options for possible paths increases factorialy.
What is the Traveling Salesman Problem?
300
programs are broken into small pieces, some of which are run simultaneously.
What is Parallel Computing?
300
it grows at a much slower rate and is faster than Linear search, BUT the data must be sorted.
What is a binary search?
400
a measure of how many steps are needed to complete an algorithm.
What is Efficiency?
400
What is a sample heuristic?
400
Provide a "good enough" solution to a problem when an actual solution is impractical or impossible.
What is heuristics?
400
Sequential time divided by parallel time.
What is Speedup?
400
As we add more inputs, the number of steps grows at the same rate.
What is linear?
500
Any algorithm whose efficiency includes an n2, n3, n4
What is a Polynomial?
500
Algorithms with exponential or factorial efficiencies are examples of algorithms that run in:
What is Unreasonable Time?
500
An example of a problem that no computer will ever be able to solve.
What is the halting problem?
500
There are some problems we’ve proven that no computer will ever be able to solve. These problems are called:
What is undecidable?
500
Any algorithm whose efficiency includes an 2n, 3n, 4n …
What is exponential?