For the sieve technique we solve the problem?
a) recursively
b) mathematically
c) accurately
d) precisely
In Sieve Technique we do not know which item is of interest?
a) True
b) False
c) NA
d) NA
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of.
a) n items
b) phases
c) pointers
d) constant
For the Sieve Technique we take time?
a) T(nk)
b) T(n/3) 4
c) n^2
d) n/3
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
How much time merge sort takes for an array of numbers?
a) (n^2)
b) T(n)
c) T( log n)
d) T(n log n)
