ISRO CSE 2016

Question 1
Which of the following is true ?
A
\sqrt{3}+\sqrt{7}=\sqrt{10}
B
\sqrt{3}+\sqrt{7}\leq \sqrt{10}
C
\sqrt{3}+\sqrt{7} \lt \sqrt{10}
D
\sqrt{3}+\sqrt{7} \gt \sqrt{10}
General Aptitude   Numerical Ability
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
A
\frac{3}{(1+x^{2})}
B
\frac{3}{(1+x^{2})^{2}}
C
\frac{3}{(1-x^{2})^{2}}
D
\frac{3}{(1-x^{2})}
Engineering Mathematics   Numerical Method
Question 3
\lim_{x\rightarrow 0}\frac{\sqrt{1+x}-\sqrt{1-x}}{x} is given by
A
0
B
-1
C
1
D
\frac{1}{2}
Engineering Mathematics   Calculus
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
A
Commutative semi group
B
Abelian group
C
Non-abelian group
D
None of these
Discrete Mathematics   Group Theory
Question 5
A given connected graph G is a Euler Graph if and only if all vertices of G are of
A
same degree
B
even degree
C
odd degree
D
different degree
Discrete Mathematics   Graph Theory
Question 6
The maximum number of edges in a n-node undirected graph without self loops is
A
n^2
B
\frac{n(n-1)}{2}
C
n-1
D
\frac{(n+1)(n)}{2}
Discrete Mathematics   Graph Theory
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
A
0 (Zero)
B
1
C
4
D
7
Digital Logic   Boolean Algebra
Question 8
The minimum Boolean expression for the following circuit is

A
AB+AC+BC
B
A+BC
C
A+B
D
A+B+C
Digital Logic   Boolean Algebra
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
A
D=AB+\bar{A}B, X=\bar{A}B
B
D=\bar{A}B+A\bar{B}, X=A\bar{B}
C
D=\bar{A}B+A\bar{B}, X=\bar{A} B
D
D=AB+\bar{A}B, X=A\bar{B}
Digital Logic   Combinational Circuit
Question 10
Consider the following gate network

Which one of the following gates is redundant?
A
Gate No. 1
B
Gate No. 2
C
Gate No. 3
D
Gate No. 4
Digital Logic   Boolean Algebra
There are 10 questions to complete.

Leave a Comment

Like this FREE website? Please share it among all your friends and join the campaign of FREE Education to ALL.