DIS_Quiz5

Question 1

The most efficient technique for finding nth Fibonacci number is recursion.

Answer 1

False

Question 2

We generally use best case running time to measure time complexity T.

Answer 2

False

Question 3

STL algorithms operate only on vectors.

Answer 3

False

Question 4

If T(n) = 2n + 100n10 + 1000n5 + 10000, then T(n) is O(n10).

Answer 4

False

Question 5

If T(n) = n3 + 1000n2log2n + 10000, then T(n) is O(n3)

Answer 5

True

Question 6

double f(unsigned n)
{
if(n == 1)
return 1.0;
else
return n + f(n/2);
}

Given the recursive function above, what is the value of f(8)?

Answer 6

15

Question 7

The time complexity of binary search is O(log(n)).

Answer 7

True

Question 8

unsigned f(unsigned n)
{
if(n == 0)
return 0;
else
return f(n / 10) + n % 10;
}

Given the recursive function above, what is the value of f(312)?

Answer 8

6

Question 9

Recursion is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem

Answer 9

True

Question 10

If you have a vector of integers v, accumulate(v.begin(),v.end(),0) returns the sum of the elements in the vector.

Answer 10

True