1

2

3

4

5

Select all that apply. Why is algorithm analysis important in software development? Sometimes it is necessary to optimize an algorithm even to gain a small improvement in the running time At the current state of computer hardware, algorithm analysis is no longer necessary, since even inefficient algorithms can be executed in reasonable amounts of time. Effort spent trying to improve algorithms that are already efficient is not wasted, since if an improvement is found, the improved algorithm can be stored and reused later. Some inefficient algorithms may not be able to solve problems beyond a trivial size in a reasonable amount of time Which of the following is the most significant contributor to an algorithms total time requirement? The algorithm's basic operation. The algorithm's output size. The most frequent operation. The algorithm's input size. Which asymptotic notation is defined by the following statement? F(n)CG(n)forallnN Big Little Little o Big O Big If you determine that an algorithm has a runtime of O(14,500) then it has an order of magnitude O(1). True False Question 8 Which of the following shows runtimes from most efficient to least efficient from left to right? O(1),O(nlogn),O(n2),O(n3),O(2n)O(n!),O(2n),O(n3),O(n2),O(1)O(nlogn),O(logn),O(n2),O(3n),O(1)O(1),O(nlogn),O(n),O(logn),O(n!) Suppose we have the following graph of two functions f(n) and g(n). Select all of the statements which are true. g(n)=O(f(n))f(n)=(g(n))f(n)=O(g(n))g(n)=(f(n))