Complexity Analysis Station [1]

What is the execution time of g(n) in the following function?

• execution time g(n) = n . execution time of f()

• execution time g(n) = n^2 . execution time of f()

• execution time g(n) = n log n . execution time of f()

• execution time g(n) = n^2 log n . execution time of f()

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?

f1(n) = 2^n

f2(n) = n^(3/2)

f3(n) = nLogn

f4(n) = n^(Logn)

• f3, f2, f4, f1

• f3, f2, f1, f4

• f2, f3, f1, f4

• f2, f3, f4, f1

What is the time complexity of this code

• O(N)

• O(Sqrt(N))

• O(N / 2)

• O(log N)

What is the execution time of g(n) in the following function?

• execution time g(n) = n^2 . execution time of f()

• execution time g(n) = n log n . execution time of f()

• execution time g(n) = n^2+n . execution time of f()

• execution time g(n) = (n^2+n)/2 . execution time of f()

What is the execution time complexity of sorting a vector?

• O(n)

• O(n log n)

• O(log n)

• O(n^2Logn)

What is asymptotic complexity in the following void function?

• O(n^2)

• O(n^2logn)

• O(n+m)

• O((n+m)^2)

The complexity of Binary search algorithm is

• O(n)

• O(log n)

• O(n2)

• O(n log n)