Consider the following recurrence relation :
$$T(n)=2 T(n-1)+n 2^n \text { for } n>0, T(0)=1$$
Which ONE of the following options is CORRECT?
Let $T(n)$ be the recurrence relation defined as follows:
$T(0) = 1$
$T(1) = 2$, and
$T(n) = 5T(n - 1) - 6T(n - 2)$ for $n \geq 2$
Which one of the following statements is TRUE?
Given an integer array of size $N$, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is
Let $$f$$ and $$g$$ be functions of natural numbers given by $$f(n)=n$$ and $$g(n)=n^2$$. Which of the following statements is/are TRUE?