introduction to daa

What is the time complexity of following code:

int a = 0, i = N; while (i > 0) { a += i; i /= 2; }

• O(N)

• B. O(Sqrt(N))

• C. O(N / 2)

• D. O(log N)

The complexity of Binary search algorithm is

• A. O(n)

• B. O(log )

• C. O(n2)

• D. O(n log n)

The complexity of merge sort algorithm is

• A. O(n)

• B. O(log n)

• C. O(n2)

• D. O(n log n)

The worst case complexity for insertion sort is

• A. O(n)

• B. O(log n)

• C. O(n2)

• D. O(n log n)

To measure Time complexity of an algorithm Big O notation is used which:

• A. describes limiting behaviour of the function

• B. characterises a function based on growth of function

• C. upper bound on growth rate of the function

• D. all of the mentioned

If for an algorithm time complexity is given by O(1) then complexityof it is:

• A. constant

• B. polynomial

• C. exponential

• D. none of the mentioned

If for an algorithm time complexity is given by O(log2n) then complexity will:

• A. constant

• B. polynomial

• C. exponential

• D. none of the mentioned

If for an algorithm time complexity is given by O((3/2)^n) then complexity will:

• A. constant

• B. quardratic

• C. exponential

• D. none of the mentioned

The time complexity of linear search is given by:

• A. O(log2n)

• B. O(1)

• C. exponential

• D. none of the mentioned

Which algorithm is better for sorting between bubble sort and quicksort?

• A. bubble sort

• B. quick sort

• C. both are equally good

• D. none of the mentioned