1:00
Click the first and last characters of the items you find.
en
WO
21
Average case : Measure of an algorithm’s performance on typical input data. (2 words)
Worst case : Measure of an algorithm’s performance on the worst possible input. (2 words)
Best case : An algorithm’s performance under optimal conditions. (2 words)
Input : Many programs are extremely sensitive to _____, and performance could fluctuate wildly depending on it.
Constant : If all instructions in a program are executed once, or only a few times, the running time is ________.
Upper bound : One step in algorithm analysis is to find the best _____ _____, which could be achieved for the worst input. (2 words)
Logarithmic : Running time where the program gets slightly slower as N grows; commonly occurs in programs that solve a problem by transforming it into a smaller problem.
Linear : The optimal running time for an algorithm that must process N inputs.
Quadratic : Running time where when N doubles, the running time is squared.
Cubic : Running time where when N doubles, the running time increases eightfold.
Exponential : Running time that is some value to the power of N.
Big Oh : The notation used to show worst case performance.
Algorithm analysis : The determination of the amount of resources (time and storage) needed to execute an algorithm. (2 words)
Efficiency : Relationship between input length and number of steps for an algorithm.
Largest : When the results of algorithm analysis are an expression consisting of a sequence of decreasing terms (n^2 + n + 1) we care most about the _______ term.
uniform : The _______ cost model assigns a constant cost to every machine operation, regardless of the size of the numbers involved.
Asymptotic : A type of analysis which estimates an upper bound for an algorithm based on its complexity for arbitrarily large input.
Increases : As input size increases, the running time of an algorithm _________.
Memory : The methods of run-time analysis can also be used for other growth rates, such as ______ usage.
Amortized : A type of analysis that considers the entire sequence of operations, not just those handling input/output, and targets the worst case scenario.
Polynomial : An algorithm is said to be of __________ time if its running time is upper bounded by a polynomial expression in the size of the input for the algorithm.
U | E | S | E | G | B | E | X | P | O | N | E | N | T | I | A | L | Z | M | N | Y | C | O | Y | C | D |
Z | J | W | F | T | Q | F | M | A | Y | A | K | D | L | J | R | G | O | I | Q | W | O | U | X | M | R |
W | Q | D | F | J | D | P | F | O | I | N | C | X | T | B | U | Y | Z | V | A | G | W | P | A | S | C |
Y | B | R | I | Y | R | S | H | V | B | A | C | R | F | N | R | H | L | A | S | Q | P | P | L | S | U |
Y | D | Q | C | D | F | Y | I | A | M | O | R | T | I | Z | E | D | I | O | M | D | O | E | G | B | R |
D | Q | T | I | J | V | F | M | P | E | L | O | L | M | Y | Y | B | I | K | I | Y | L | R | O | W | R |
P | F | C | E | Z | I | U | P | N | N | F | D | R | N | Z | D | W | I | Q | G | J | Y | B | R | R | L |
Z | T | G | N | Y | L | P | J | I | I | I | T | V | E | S | G | X | T | G | L | U | N | O | I | U | W |
M | R | H | C | N | A | V | E | R | A | G | E | C | A | S | E | D | O | Y | O | M | O | U | T | O | M |
Q | U | Z | Y | E | K | K | T | O | E | Y | L | S | R | U | I | H | F | U | H | H | M | N | H | P | U |
W | W | E | Y | Y | N | V | Z | S | J | M | N | I | P | A | O | M | Q | F | F | M | I | D | M | O | W |
H | Z | Y | G | X | V | S | A | H | O | K | J | G | N | O | S | B | S | R | J | O | A | P | A | Z | Q |
L | J | K | S | O | O | C | A | B | H | Y | L | V | G | E | Q | Y | Y | D | G | A | L | L | N | F | B |
O | W | N | S | I | T | N | H | T | S | E | Q | W | B | I | A | U | M | Z | D | P | N | E | A | H | T |
I | W | G | H | S | E | R | U | N | I | F | O | R | M | Y | N | R | A | P | A | E | R | U | L | H | O |
N | L | S | E | Q | S | W | K | H | N | Y | G | W | J | W | R | C | F | D | T | H | S | Z | Y | U | M |
P | O | B | U | T | Q | V | L | W | O | N | O | C | W | U | H | T | R | Y | R | O | G | U | S | X | M |
U | J | W | L | L | E | N | I | E | C | F | V | Y | O | A | Q | T | Q | E | T | A | T | I | I | Z | X |
T | I | Y | A | J | I | D | C | I | C | K | P | P | R | T | N | D | L | N | A | I | T | I | S | D | X |
L | S | C | R | B | Q | N | L | R | U | C | Y | F | S | A | Z | D | G | Y | T | S | Q | I | C | R | D |
O | Y | L | G | F | D | S | B | G | K | R | I | S | T | M | C | X | S | B | B | B | E | H | C | Y | G |
U | L | V | E | Y | S | E | Z | Y | O | B | F | S | C | H | K | T | E | A | F | F | C | S | N | Z | C |
S | I | Q | S | V | T | R | M | M | Z | N | N | Z | A | O | F | C | U | B | I | C | B | C | U | J | A |
Z | H | B | T | F | V | A | E | U | G | O | J | O | S | Z | H | U | A | U | A | B | C | M | E | E | J |
R | D | L | M | Z | J | M | S | J | C | A | C | L | E | K | I | N | F | O | U | H | J | V | F | M | G |
F | D | Q | E | Z | Z | T | Z | W | Q | S | A | E | N | L | O | G | A | R | I | T | H | M | I | C | U |
- The determination of the amount of resources (time and storage) needed to execute an algorithm. (2 words)
- A type of analysis that considers the entire sequence of operations, not just those handling input/output, and targets the worst case scenario.
- A type of analysis which estimates an upper bound for an algorithm based on its complexity for arbitrarily large input.
- Measure of an algorithm’s performance on typical input data. (2 words)
- An algorithm’s performance under optimal conditions. (2 words)
- The notation used to show worst case performance.
- If all instructions in a program are executed once, or only a few times, the running time is ________.
- Running time where when N doubles, the running time increases eightfold.
- Relationship between input length and number of steps for an algorithm.
- Running time that is some value to the power of N.
- As input size increases, the running time of an algorithm _________.
| - Many programs are extremely sensitive to _____, and performance could fluctuate wildly depending on it.
- When the results of algorithm analysis are an expression consisting of a sequence of decreasing terms (n^2 + n + 1) we care most about the _______ term.
- The optimal running time for an algorithm that must process N inputs.
- Running time where the program gets slightly slower as N grows; commonly occurs in programs that solve a problem by transforming it into a smaller problem.
- The methods of run-time analysis can also be used for other growth rates, such as ______ usage.
- An algorithm is said to be of __________ time if its running time is upper bounded by a polynomial expression in the size of the input for the algorithm.
- Running time where when N doubles, the running time is squared.
- The _______ cost model assigns a constant cost to every machine operation, regardless of the size of the numbers involved.
- One step in algorithm analysis is to find the best _____ _____, which could be achieved for the worst input. (2 words)
- Measure of an algorithm’s performance on the worst possible input. (2 words)
|
© 2013
PuzzleFast.com, Noncommercial Use Only
U | E | S | E | G | B | E | X | P | O | N | E | N | T | I | A | L | Z | M | N | Y | C | O | Y | C | D |
Z | J | W | F | T | Q | F | M | A | Y | A | K | D | L | J | R | G | O | I | Q | W | O | U | X | M | R |
W | Q | D | F | J | D | P | F | O | I | N | C | X | T | B | U | Y | Z | V | A | G | W | P | A | S | C |
Y | B | R | I | Y | R | S | H | V | B | A | C | R | F | N | R | H | L | A | S | Q | P | P | L | S | U |
Y | D | Q | C | D | F | Y | I | A | M | O | R | T | I | Z | E | D | I | O | M | D | O | E | G | B | R |
D | Q | T | I | J | V | F | M | P | E | L | O | L | M | Y | Y | B | I | K | I | Y | L | R | O | W | R |
P | F | C | E | Z | I | U | P | N | N | F | D | R | N | Z | D | W | I | Q | G | J | Y | B | R | R | L |
Z | T | G | N | Y | L | P | J | I | I | I | T | V | E | S | G | X | T | G | L | U | N | O | I | U | W |
M | R | H | C | N | A | V | E | R | A | G | E | C | A | S | E | D | O | Y | O | M | O | U | T | O | M |
Q | U | Z | Y | E | K | K | T | O | E | Y | L | S | R | U | I | H | F | U | H | H | M | N | H | P | U |
W | W | E | Y | Y | N | V | Z | S | J | M | N | I | P | A | O | M | Q | F | F | M | I | D | M | O | W |
H | Z | Y | G | X | V | S | A | H | O | K | J | G | N | O | S | B | S | R | J | O | A | P | A | Z | Q |
L | J | K | S | O | O | C | A | B | H | Y | L | V | G | E | Q | Y | Y | D | G | A | L | L | N | F | B |
O | W | N | S | I | T | N | H | T | S | E | Q | W | B | I | A | U | M | Z | D | P | N | E | A | H | T |
I | W | G | H | S | E | R | U | N | I | F | O | R | M | Y | N | R | A | P | A | E | R | U | L | H | O |
N | L | S | E | Q | S | W | K | H | N | Y | G | W | J | W | R | C | F | D | T | H | S | Z | Y | U | M |
P | O | B | U | T | Q | V | L | W | O | N | O | C | W | U | H | T | R | Y | R | O | G | U | S | X | M |
U | J | W | L | L | E | N | I | E | C | F | V | Y | O | A | Q | T | Q | E | T | A | T | I | I | Z | X |
T | I | Y | A | J | I | D | C | I | C | K | P | P | R | T | N | D | L | N | A | I | T | I | S | D | X |
L | S | C | R | B | Q | N | L | R | U | C | Y | F | S | A | Z | D | G | Y | T | S | Q | I | C | R | D |
O | Y | L | G | F | D | S | B | G | K | R | I | S | T | M | C | X | S | B | B | B | E | H | C | Y | G |
U | L | V | E | Y | S | E | Z | Y | O | B | F | S | C | H | K | T | E | A | F | F | C | S | N | Z | C |
S | I | Q | S | V | T | R | M | M | Z | N | N | Z | A | O | F | C | U | B | I | C | B | C | U | J | A |
Z | H | B | T | F | V | A | E | U | G | O | J | O | S | Z | H | U | A | U | A | B | C | M | E | E | J |
R | D | L | M | Z | J | M | S | J | C | A | C | L | E | K | I | N | F | O | U | H | J | V | F | M | G |
F | D | Q | E | Z | Z | T | Z | W | Q | S | A | E | N | L | O | G | A | R | I | T | H | M | I | C | U |
- ALGORITHMANALYSIS
- AMORTIZED
- ASYMPTOTIC
- AVERAGECASE
- BESTCASE
- BIGOH
- CONSTANT
- CUBIC
- EFFICIENCY
- EXPONENTIAL
- INCREASES
| - INPUT
- LARGEST
- LINEAR
- LOGARITHMIC
- MEMORY
- POLYNOMIAL
- QUADRATIC
- UNIFORM
- UPPERBOUND
- WORSTCASE
|
© 2013
PuzzleFast.com, Noncommercial Use Only