Consider the following three claims
I. (n + k)^m = $$\Theta \,({n^m})$$ where k and m are constants
II. 2ⁿ⁺¹ = O(2ⁿ)
III. 2²ⁿ = O(2²ⁿ)
Which of those claims are correct?

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

Let f(n) = n² log n and g(n) = n(log n)¹⁰ be two positive functions of n. Which of the following statements is correct?

The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is