Algorithm analysis focuses on the ORDER of an algorithm, that is it's ____ rate function.
Growth
none of the above
Q: Which of these algorithms is faster
a.N^2
b.N
c.N^2 +2N
d.N + N
e.a & c
f.b & d
what is algorithm analysis concerned with?
A.what its start points are
B,how well it handles inputs
C.how fast a program runs
D.how many times it loop
Algorithm analysis focuses on the ORDER of an algorithm
what is the name of this common growth rate O(1)?
A)factorial
B)linear
C)constant time
D)logarithmic
If an algorithm requires f(n) time, then it is oder f(n), or O(f(n)), if there is a constant k such that for large values of n:
a. f(n) >= k*f(n)
b. f(n) = f(n^2)
c. f(n) <= k*f(n)
d. None of the above!
What is the order of the function x^2 - 7x + 3?
A) O(n)
B) O(log n)
C) O(2n)
D) O(n^2)
Algorithm analysis focuses more on how fast a program runs rather than how efficient the algorithm is as inputs increase.
Which of the following is a reasonable conclusion from analzying an algorithm?
A. The algorithm requres 5 * N time units to solve a problem with N inputs
B. The program implementing the algorithm took 0.5 seconds to execute
C. Algorithm A requres more time units to solve a problem than B
D. The algorithm appears effecient because it looks like it would be.
What is O(1)?
A) Logarithmic
B) Linear
C) Constant
D) None of the above
All of the following are properties of growth-rate functions except for one. Which is NOT a property of growth-rate functions?
A. can ignore lower order terms
B. cannot ignore the multiplicative constant for the highest-order term
C. the sum of orders is the order of the sums
D. the product of orders is the order of the products
Algorithm analysis reaches conclusions like:
A. Algorithm A requires N^2/5 time units to solve a problem with n inputs
B. Algorithm B requires 5*N time units to solve a problem with n inputs
C. Algorithm B is more efficient than Algorithm A
D. All of the above
These typical growth rates are put in order from best to worst
O(1), O(log N), O(N logN), O(log^2 N), O(N), O(N^2), O(N^3), O(2^N)
Is the following description of properties of growth-rate function correct?
1) ignore lower order terms 2) ignore the multiplicative constant for the highest-order term 3) O ( f(n) ) + O ( g(n) ) = O ( f(n) + g(n) )
a. yes, correct
b. no, incorrect
If f(n) = n^4 and g(n) = 4n, what is O( f(n) ) + O( g(n) )?
O( f(n) + g(n) ) = O(n^4 + 4n) = O(n^4)
