7. Algorithm Growth Rate

Descrição

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
Mena Sargios
Quiz por Mena Sargios, atualizado more than 1 year ago
Mena Sargios
Criado por Mena Sargios mais de 7 anos atrás
485
0

Resumo de Recurso

Questão 1

Questão
Algorithm analysis focuses on the ORDER of an algorithm, that is it's ____ rate function.
Responda
  • Growth
  • none of the above

Questão 2

Questão
Q: Which of these algorithms is faster
Responda
  • a.N^2
  • b.N
  • c.N^2 +2N
  • d.N + N
  • e.a & c
  • f.b & d

Questão 3

Questão
what is algorithm analysis concerned with?
Responda
  • A.what its start points are
  • B,how well it handles inputs
  • C.how fast a program runs
  • D.how many times it loop

Questão 4

Questão
Algorithm analysis focuses on the ORDER of an algorithm
Responda
  • True
  • False

Questão 5

Questão
what is the name of this common growth rate O(1)?
Responda
  • A)factorial
  • B)linear
  • C)constant time
  • D)logarithmic

Questão 6

Questão
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:
Responda
  • a. f(n) >= k*f(n)
  • b. f(n) = f(n^2)
  • c. f(n) <= k*f(n)
  • d. None of the above!

Questão 7

Questão
What is the order of the function x^2 - 7x + 3?
Responda
  • A) O(n)
  • B) O(log n)
  • C) O(2n)
  • D) O(n^2)

Questão 8

Questão
Algorithm analysis focuses more on how fast a program runs rather than how efficient the algorithm is as inputs increase.
Responda
  • True
  • False

Questão 9

Questão
Which of the following is a reasonable conclusion from analzying an algorithm?
Responda
  • 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.

Questão 10

Questão
What is O(1)?
Responda
  • A) Logarithmic
  • B) Linear
  • C) Constant
  • D) None of the above

Questão 11

Questão
All of the following are properties of growth-rate functions except for one. Which is NOT a property of growth-rate functions?
Responda
  • 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

Questão 12

Questão
Algorithm analysis reaches conclusions like:
Responda
  • 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

Questão 13

Questão
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)
Responda
  • True
  • False

Questão 14

Questão
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) )
Responda
  • a. yes, correct
  • b. no, incorrect

Questão 15

Questão
If f(n) = n^4 and g(n) = 4n, what is O( f(n) ) + O( g(n) )?
Responda
  • O( f(n) + g(n) ) = O(n^4 + 4n) = O(n^4)
  • none of the above

Semelhante

2. Red Black Tree
Mena Sargios
12. Graph Traversal
Mena Sargios
5. B-Tree
Mena Sargios
3. 2-3 Tree
Mena Sargios
16. Greedy Algorithm (Huffman code)
Mena Sargios
4. 2-3-4 Tree
Mena Sargios
14. Graph Shrtest Path
Mena Sargios
1. Trees Splay Trees
Mena Sargios
10. Hashing Collision
Mena Sargios
15. Graph Spanning Tree
Mena Sargios
13. Graph Topoligical Sorting
Mena Sargios