Mena Sargios
Quiz by , created more than 1 year ago

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU

502
0
0
Mena Sargios
Created by Mena Sargios about 8 years ago
Close

7. Algorithm Growth Rate

7. Algorithm Growth Rate

Question 1 of 15

1

Algorithm analysis focuses on the ORDER of an algorithm, that is it's ____ rate function.

Select one of the following:

  • Growth

  • none of the above

Explanation

Question 2 of 15

1

Q: Which of these algorithms is faster

Select one of the following:

  • a.N^2

  • b.N

  • c.N^2 +2N

  • d.N + N

  • e.a & c

  • f.b & d

Explanation

Question 3 of 15

1

what is algorithm analysis concerned with?

Select one of the following:

  • A.what its start points are

  • B,how well it handles inputs

  • C.how fast a program runs

  • D.how many times it loop

Explanation

Question 4 of 15

1

Algorithm analysis focuses on the ORDER of an algorithm

Select one of the following:

  • True
  • False

Explanation

Question 5 of 15

1

what is the name of this common growth rate O(1)?

Select one of the following:

  • A)factorial

  • B)linear

  • C)constant time

  • D)logarithmic

Explanation

Question 6 of 15

1

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:

Select one of the following:

  • a. f(n) >= k*f(n)

  • b. f(n) = f(n^2)

  • c. f(n) <= k*f(n)

  • d. None of the above!

Explanation

Question 7 of 15

1

What is the order of the function x^2 - 7x + 3?

Select one of the following:

  • A) O(n)

  • B) O(log n)

  • C) O(2n)

  • D) O(n^2)

Explanation

Question 8 of 15

1

Algorithm analysis focuses more on how fast a program runs rather than how efficient the algorithm is as inputs increase.

Select one of the following:

  • True
  • False

Explanation

Question 9 of 15

1

Which of the following is a reasonable conclusion from analzying an algorithm?

Select one of the following:

  • 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.

Explanation

Question 10 of 15

1

What is O(1)?

Select one of the following:

  • A) Logarithmic

  • B) Linear

  • C) Constant

  • D) None of the above

Explanation

Question 11 of 15

1

All of the following are properties of growth-rate functions except for one.
Which is NOT a property of growth-rate functions?

Select one of the following:

  • 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

Explanation

Question 12 of 15

1

Algorithm analysis reaches conclusions like:

Select one of the following:

  • 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

Explanation

Question 13 of 15

1

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)

Select one of the following:

  • True
  • False

Explanation

Question 14 of 15

1

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) )

Select one of the following:

  • a. yes, correct

  • b. no, incorrect

Explanation

Question 15 of 15

1

If f(n) = n^4 and g(n) = 4n, what is O( f(n) ) + O( g(n) )?

Select one of the following:

  • O( f(n) + g(n) ) = O(n^4 + 4n) = O(n^4)

  • none of the above

Explanation

Previous
Check answer
Next