Question 1 |
The rank of the matrix \begin{bmatrix} 1 & 1\\ 0& 0 \end{bmatrix} is
4 | |
2 | |
1 | |
0 |
Question 1 Explanation:
Question 2 |
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree
0 but not 1 | |
1 but not 0 | |
0 or 1 | |
2 |
Question 2 Explanation:
Question 3 |
The solution to the recurrence equation T(2^{k})=3T(2^{k-1})+1,T(1)=1 is
2^{k} | |
\frac{3^{k+1}-1}{2} | |
3^{log_{2}^{k}} | |
2^{log_{3}^{k}} |
Question 3 Explanation:
Question 4 |
The minimum number of colours required to colour the vertices of a cycle with n
nodes in such a way that no two adjacent nodes have same colour is.
2 | |
3 | |
4 | |
n-2[\frac{n}{2}]+2 |
Question 4 Explanation:
Question 5 |
In the worst case, the number of comparisons needed to search a single linked list
of length n for a given element is
log n | |
n/2 | |
log_{2}^{n}-1 | |
n |
Question 5 Explanation:
There are 5 questions to complete.