1
GATE ECE 2014 Set 1
Numerical
+2
-0
A fair coin is tossed repeatedly until a 'Head' appears for the first time. Let L be the number of tosses to get this first 'Head'. The entropy H (L) in bits is _______________.
2
GATE ECE 2009
+2
-0.6
A communication channel with AWGN operating at a signal to noise ratio SNR > > 1 and band width B has capacity $${{C_1}}$$ . If the SNR is doubled keeping B constant, the resulting capacity $${{C_2}}$$ is given
A
$${C_2}\, \approx \,2\,{C_1}\,$$
B
$${C_2}\, \approx \,{C_1}\, + \,B$$
C
$${C_2}\, \approx \,{C_1}\, + \,2B$$
D
$${C_2}\, \approx \,{C_1}\, + \,0.3B$$
3
GATE ECE 2008
+2
-0.6
A memory less source emits n symbols each with a probability p. The entropy of the source as a function of n
A
increases as log n
B
decreases as log (1 / n)
C
increases as n
D
increases as n log n
4
GATE ECE 2006
+2
-0.6
A source generates three symbols with probabilities 0.25, 0.25, 0.50 at a rate of 3000 symbols per second. Assuming independent generation of symbols, the most efficient source encoder would have average bit rate as
A
6000 bits/sec
B
4500 bits/sec
C
3000 bits/sec
D
1500 bits/sec
EXAM MAP
Medical
NEET