Question 1 |

Which of the following is true ?

\sqrt{3}+\sqrt{7}=\sqrt{10} | |

\sqrt{3}+\sqrt{7}\leq \sqrt{10} | |

\sqrt{3}+\sqrt{7} \lt \sqrt{10} | |

\sqrt{3}+\sqrt{7} \gt \sqrt{10} |

Question 1 Explanation:

Question 2 |

What is the sum to infinity of the series,

3+6 x^{2}+9 x^{4}+12 x^{6}+\ldots \text { given }|x| \lt 1

3+6 x^{2}+9 x^{4}+12 x^{6}+\ldots \text { given }|x| \lt 1

\frac{3}{(1+x^{2})} | |

\frac{3}{(1+x^{2})^{2}} | |

\frac{3}{(1-x^{2})^{2}} | |

\frac{3}{(1-x^{2})} |

Question 2 Explanation:

Question 3 |

\lim_{x\rightarrow 0}\frac{\sqrt{1+x}-\sqrt{1-x}}{x} is given by

0 | |

-1 | |

1 | |

\frac{1}{2} |

Question 3 Explanation:

Question 4 |

f (G,.) is a group such that (ab)^{-1}=a^{-1}b^{-1},\forall a,b \in G, then G is a/an

Commutative semi group | |

Abelian group | |

Non-abelian group | |

None of these |

Question 4 Explanation:

Question 5 |

A given connected graph G is a Euler Graph if and only if all vertices of G are of

same degree | |

even degree | |

odd degree | |

different degree |

Question 5 Explanation:

Question 6 |

The maximum number of edges in a n-node undirected graph without self loops is

n^2 | |

\frac{n(n-1)}{2} | |

n-1 | |

\frac{(n+1)(n)}{2} |

Question 6 Explanation:

Question 7 |

The minimum number of \text{NAND} gates required to implement the Boolean function A + A\bar{B} + A\bar{B}C is equal to

0 (Zero) | |

1 | |

4 | |

7 |

Question 7 Explanation:

Question 8 |

The minimum Boolean expression for the following circuit is

AB+AC+BC | |

A+BC | |

A+B | |

A+B+C |

Question 8 Explanation:

Question 9 |

For a binary half-subtractor having two inputs A and B, the correct set of logical outputs D(=A minus B) and X(=borrow) are

D=AB+\bar{A}B, X=\bar{A}B | |

D=\bar{A}B+A\bar{B}, X=A\bar{B} | |

D=\bar{A}B+A\bar{B}, X=\bar{A} B | |

D=AB+\bar{A}B, X=A\bar{B} |

Question 9 Explanation:

Question 10 |

Consider the following gate network

Which one of the following gates is redundant?

Which one of the following gates is redundant?

Gate No. 1 | |

Gate No. 2 | |

Gate No. 3 | |

Gate No. 4 |

Question 10 Explanation:

There are 10 questions to complete.