Question 1 |
Let G=(V, E) be a graph. Define \xi (G)=\sum_{d}i_{d}*d , where i_{d} is the number of
vertices of degree d in G. If S and T are two different trees with \xi (S)=\xi (T) , then
|S|= 2|T| | |
|S|=|T|-1 | |
|S|=|T| | |
|S|=|T|+1 |
Question 1 Explanation:
Question 2 |
Newton-Raphson method is used to compute a root of the equation x^{2} -13=0
with 3.5 as the initial value. The approximation after one iteration is
3.575 | |
3.676 | |
3.667 | |
3.607 |
Question 2 Explanation:
Question 3 |
What is the possible number of reflexive relations on a set of 5 elements?
2^{10} | |
2^{15} | |
2^{20} | |
2^{25} |
Question 3 Explanation:
Question 4 |
Consider the set S = {1, \omega ,\omega ^{2}}, where \omega and \omega ^{2} are cube roots of unity. If * denotes the multiplication operation, the structure (S, *) forms
A group | |
A ring | |
An integral domain | |
A field |
Question 4 Explanation:
Question 5 |
What is the value of \lim_{n\rightarrow \infty }(1-\frac{1}{n})^{2n}?
0 | |
e^{-2} | |
e^{-1/2} | |
1 |
Question 5 Explanation:
There are 5 questions to complete.