Exam 2: Analysis of Algorithms

Which Growth function has the highest order?

A __ function shows time or space utilization relative to the problem size.

Algorithm ______ is a fundamental computer science topic.

How do we use the growth function of an algorithm to determine its order?

Software must make efficient use of resources such as CPU time and memory.

If the algorithm is inefficient, a faster processor will help.

The order of an algorithm is found by eliminating constants and all but the dominant term in the algorithm's growth function.

How do we determine the time complexity of a method call?

The following code segment has ______ time complexity?

Software must make efficient use of resources such as _______ and _______ .

Which of the following has the smallest time complexity?

The order of an algorithm provides a lower bound to the algorithm's growth function.

Method calls are always O(n).

How do we determine the time complexity of a loop?

The order of an algorithm refers to the ______ of the algorithm's growth function.

If the algorithm is ______, a faster processor will not help in the long run.

The analysis of nested loops must take into account both the ______.

What is the difference between the growth function of an algorithm and the order of that algorithm?

What is the order of the following growth function? t(n)= 5nlogn + 20n - 4

What is the time complexity of the following loop?