Answer the following statements true (T) or false (F)
1) A program is more efficient if it uses more CPU time
2) One of the ways to express the size of a problem is in terms of the number of items to be processed.
3) If the growth function for an algorithm is expressed as a polynomial, then the asymptotic complexity of the algorithm is
determined by the term with the smallest exponent of the variable.
4) The asymptotic complexity of an algorithm is also called the order of the algorithm.
5) All of the terms in a growth function contribute to the order of the function
1) F
2) T
3) F
4) T
5) F
You might also like to view...
To display the ruler in Word, select the Ruler check box on the VIEW tab
Indicate whether the statement is true or false
The ________ query is a query that tabulates totals across two or more categories
A) Find Duplicates B) Crosstab C) Select D) Append