Quiz
7. Algorithm Growth Rate
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (15)
1Algorithm analysis focuses on the ORDER of an algorithm, that is it's ____ rate function.
- AGrowth
- Bnone of the above
2Q: Which of these algorithms is faster
- Aa.N^2
- Bb.N
- Cc.N^2 +2N
- Dd.N + N
- Ee.a & c
- Ff.b & d
3what is algorithm analysis concerned with?
- AA.what its start points are
- BB,how well it handles inputs
- CC.how fast a program runs
- DD.how many times it loop
4Algorithm analysis focuses on the ORDER of an algorithm
- ATrue
- BFalse
5what is the name of this common growth rate O(1)?
- AA)factorial
- BB)linear
- CC)constant time
- DD)logarithmic
6If 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:- Aa. f(n) >= k*f(n)
- Bb. f(n) = f(n^2)
- Cc. f(n) <= k*f(n)
- Dd. None of the above!
7What is the order of the function x^2 - 7x + 3?
- AA) O(n)
- BB) O(log n)
- CC) O(2n)
- DD) O(n^2)
8
Algorithm analysis focuses more on how fast a program runs rather than how efficient the algorithm is as inputs increase.- ATrue
- BFalse
9Which of the following is a reasonable conclusion from analzying an algorithm?
- AA. The algorithm requres 5 * N time units to solve a problem with N inputs
- BB. The program implementing the algorithm took 0.5 seconds to execute
- CC. Algorithm A requres more time units to solve a problem than B
- DD. The algorithm appears effecient because it looks like it would be.
10What is O(1)?
- AA) Logarithmic
- BB) Linear
- CC) Constant
- DD) None of the above
11All of the following are properties of growth-rate functions except for one.
Which is NOT a property of growth-rate functions?- AA. can ignore lower order terms
- BB. cannot ignore the multiplicative constant for the highest-order term
- CC. the sum of orders is the order of the sums
- DD. the product of orders is the order of the products
12Algorithm analysis reaches conclusions like:
- AA. Algorithm A requires N^2/5 time units to solve a problem with n inputs
- BB. Algorithm B requires 5*N time units to solve a problem with n inputs
- CC. Algorithm B is more efficient than Algorithm A
- DD. All of the above
13These 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)- ATrue
- BFalse
14Is 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) )- Aa. yes, correct
- Bb. no, incorrect
15If f(n) = n^4 and g(n) = 4n, what is O( f(n) ) + O( g(n) )?
- AO( f(n) + g(n) ) = O(n^4 + 4n) = O(n^4)
- Bnone of the above
Information
- Description
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Author
- Mena Sargios
- Language
- English
- Views
- 561
- Tags
- Rating
- No ratings yet Rate this quiz