What is the solution to the recurrence T (n) = T (n/2) + n?
a) O(logn)
b) O(n)
c) O(nlogn)
d) O(n^2)
If algorithm A has running time 7n^2+2n+ 3 and algorithm B has running time 2n^2, then?
a) Both have same asymptotic time complexity
b) A is asymptotically greater
c) B is asymptotically greater
d) None of others
Which sorting algorithm is faster?
a) O(n log n)
b) O (n^2)
c) O (n+k)
d) O (n^3)
The appropriate big theta classification of the given function. f(n) = 4n2 +97n + 1000 is?
a) ?(n)
b) O(2^n)
c) O(n^2)
d) O(n^2logn)
Let us say we have an algorithm that carries out N^2 operations for an input of size N. Let us say that a computer takes 1 microsecond (1/1000000 second) to carry out one operation. How long does the algorithm run for an input of size 3000?
a) 90 seconds
b) 9 seconds
c) 0.9 seconds
d) 0.09 seconds
Function is given like 4n^4+ 5n^3+n what is the run time of this?
a) theata(n^4)
b) theata (n^3)
c) theata (4n^4+ 5n^3)
d) theata (4n^4+ 5n^3)\
