Consider the following Algorithm: Factorial (n){ if (n=1) return 1 else return (n *Factorial(n-1)) { Recurrence for the following algorithm is:
a) T(n) = T(n-1)+1
b) T(n) = nT(n-1) +1
c) T(n)= T(n-1) +n
d) T(n)=T(n(n-1))+1
The problem with the brute-force algorithm is that it uses in pruning out decisions.
a) intelligence
b) no intelligence
c) N/A
d) NA
We introduced a brute-force algorithm that ran in.....
a) O(n) time
b) O(n^2) time
c) O(nlogn) time
d) O(n^3) time
A point p is said to dominated by point q if p.x
a) True
b) False
c) NA
d) N/A
We write out the loop as summation and then solve the summation?
a) True
b) False
c) NA
d) N/A
Given a finite sequence of values a1, a2,..., an, their sum a1 + a2+...+anis expressed in summation notation as Sigma (i=1 ->n)ai?
a) True
b) False
c) NA
d) NA
