Question 1

Which Growth function has the highest order?

Accepted Answer

A)   O(n log n) 
B)   O(n2) 
C)   O(2n) 
D)   O(log n)  C

Question 2

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

Accepted Answer

growth

Question 3

Algorithm ______ is a fundamental computer science topic.

Accepted Answer

analysis

Question 4

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

Accepted Answer

The answer of How do we use the growth function...

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

The answer of How do we determine the time complexity...

Question 9

The following code segment has ______ time complexity?

Accepted Answer

A)   O(1) 
B)   O(n) 
C)   O(n2) 
D)   O(nlogn)

Question 10

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

Accepted Answer

A)   Hard Drive, Video Card
B)   CPU time, Memory
C)   CPU time, Video Card
D)   Memory, Hard Drive

Question 11

Which of the following has the smallest time complexity?

Accepted Answer

A)   3n+5+2n
B)   Logn + 2
C)   3n+4
D)   n logn

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

Method calls are always O(n).

Accepted Answer

A) True 
 B)False

Question 14

How do we determine the time complexity of a loop?

Accepted Answer

The answer of How do we determine the time complexity...

Question 15

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

Accepted Answer

The answer of The order of an algorithm refers to...

Question 16

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

Accepted Answer

The answer of If the algorithm is ______, a faster...

Question 17

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

Accepted Answer

The answer of The analysis of nested loops must take...

Question 18

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

Accepted Answer

The answer of What is the difference between the growth...

Question 19

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

Accepted Answer

A)   O(1) 
B)   O(log n) 
C)   O(n) 
D)   O(n log n)

Question 20

What is the time complexity of the following loop?

Accepted Answer

A)   O(n2) 
B)   O(n3) 
C)   O(n) 
D)   O(2n)

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?