1
GATE ECE 2001
MCQ (Single Correct Answer)
+2
-0.6
During transmission over a communication channel, bit errors occur independently with probability 'p'. If a block of n bits is transmitted, the probability of at most one bit error is equal to
A
$$1 - {\left( {1 - p} \right)^n}$$
B
$$p + \left( {n - 1} \right)\left( {1 - p} \right)$$
C
$$np - {\left( {1 - p} \right)^{n - 1}}$$
D
$${\left( {1 - p} \right)^n} + np{\left( {1 - p} \right)^{n - 1}}$$
2
GATE ECE 2001
MCQ (Single Correct Answer)
+1
-0.3
The PDF of a Gaussian random variable X is given by $${p_x}(x) = \,{1 \over {3\sqrt {2\pi } }}\,\exp \,[ - \,{(x - 4)^2}/18]$$.

The probability of the event {X = 4} is

A
1/2
B
$$1/\left( {3\sqrt {2\,\pi } } \right)$$
C
0
D
1/4
3
GATE ECE 2001
MCQ (Single Correct Answer)
+1
-0.3
Given the $$G\left(s\right)H\left(s\right)=\frac K{s\left(s+1\right)\left(s+3\right)}$$, the point of intersection of the asymptotes of the root loci with the real axis is
A
-4
B
1.33
C
-1.33
D
4
4
GATE ECE 2001
Subjective
+5
-0
A feedback control system is shown in figure GATE ECE 2001 Control Systems - Signal Flow Graph and Block Diagram Question 17 English (a) Draw the signal-flow graph that represents the system.
(b) Find the total number of loops in the graph and determine the loop-gains of all the loops.
(c) Find the number of all possible combination of non-touching loops taken two at a time.
(d) Determine the transfer function of the system using the signal-flow graph.