7129360
Description
Quiz by Mena Sargios, updated more than 1 year ago
|
Created by Mena Sargios
over 7 years ago
|
|
Question 1
Question
Algorithm analysis focuses on the ORDER of an algorithm, that is it's ____ rate function.
Answer
-
Growth
-
none of the above
Question 2
Question
Q: Which of these algorithms is faster
Answer
-
a.N^2
-
b.N
-
c.N^2 +2N
-
d.N + N
-
e.a & c
-
f.b & d
Question 3
Question
what is algorithm analysis concerned with?
Answer
-
A.what its start points are
-
B,how well it handles inputs
-
C.how fast a program runs
-
D.how many times it loop
Question 4
Question
Algorithm analysis focuses on the ORDER of an algorithm
Answer
- True
- False
Question 5
Question
what is the name of this common growth rate O(1)?
Answer
-
A)factorial
-
B)linear
-
C)constant time
-
D)logarithmic
Question 6
Question
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:
Answer
-
a. f(n) >= k*f(n)
-
b. f(n) = f(n^2)
-
c. f(n) <= k*f(n)
-
d. None of the above!
Question 7
Question
What is the order of the function x^2 - 7x + 3?
Answer
-
A) O(n)
-
B) O(log n)
-
C) O(2n)
-
D) O(n^2)
Question 8
Question
Algorithm analysis focuses more on how fast a program runs rather than how efficient the algorithm is as inputs increase.
Answer
- True
- False
Question 9
Question
Which of the following is a reasonable conclusion from analzying an algorithm?
Answer
-
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.
Question 10
Question
What is O(1)?
Answer
-
A) Logarithmic
-
B) Linear
-
C) Constant
-
D) None of the above
Question 11
Question
All of the following are properties of growth-rate functions except for one.
Which is NOT a property of growth-rate functions?
Answer
-
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
Question 12
Question
Algorithm analysis reaches conclusions like:
Answer
-
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
Question 13
Question
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)
Answer
- True
- False
Question 14
Question
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) )
Answer
-
a. yes, correct
-
b. no, incorrect
Question 15
Question
If f(n) = n^4 and g(n) = 4n, what is O( f(n) ) + O( g(n) )?
Answer
-
O( f(n) + g(n) ) = O(n^4 + 4n) = O(n^4)
-
none of the above
Want to create your own Quizzes for free with GoConqr? Learn more.