Question 1 |
If g(x)=1-x and h(x)=\frac{x}{x-1}, then \frac{g(h(x))}{h(g(x))} is:
\frac{h(x)}{g(x)} | |
\frac{-1}{x} | |
\frac{g(x)}{h(x)} | |
\frac{x}{(1-x)^{2}} |
Question 1 Explanation:
Question 2 |
\lim_{x\rightarrow \infty }x^{1/x} is
\infty | |
0 | |
1 | |
Not defined |
Question 2 Explanation:
Question 3 |
Match the following:

P-iii, Q-ii, R-iv, S-i | |
P-i, Q-ii, R-iv, S-iii | |
P-ii, Q-iii, R-iv, S-i | |
P-ii, Q-i, R-iii, S-iv |
Question 3 Explanation:
Question 4 |
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n ( \geq2) numbers? In the recurrence equations given in the options below, c is a constant.
T(n)=2T(n/2)+cn | |
T(n)=T(n-1)+T(1)+cn | |
T(n)=2T(n-1)+cn | |
T(n)=T(n/2)+cn |
Question 4 Explanation:
Question 5 |
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
63 and 6, respectively | |
64 and 5, respectively | |
32 and 6, respectively | |
31 and 5, respectively |
Question 5 Explanation:
There are 5 questions to complete.