Answer the following statements true (T) or false (F)
1. The analysis of an algorithm must take into consideration the computer that will be used to run a program that implements the algorithm.
2. For a problem of size n, if Algorithm A requires time proportional to n, and Algorithm B requires time proportional to n2, B’s time requirement increases at a slower rate than A’s time requirement.
3. The values of the growth-rate function O(log2 n) grow faster than the values of the growth-rate function O(n).
4. Low-order terms in an algorithm’s growth-rate function can be ignored.
5. Function f(n) is O( g(n) ) if f(n)>g(n) for all n>0.
1. False
2. False
3. False
4. True
5. False
You might also like to view...
To use the current date as the default value for a Date/Time field, type Date() in the Default Value box
Indicate whether the statement is true or false
A(n) ________ error is caused by not following the strict, precise set of rules for a specific programming language.
Fill in the blank(s) with the appropriate word(s).