NEW
Font size
WorksheetsUNIT 1 - INFORMATION THEORY
Total questions: 20
Worksheet time: 10mins
For M equally likely messages, the average amount of information H is
H = log10M
H = log2M
H = log10M2
H = 2log10M
The channel capacity is
The maximum information transmitted by one symbol over the channel
Information contained in a signal
The amplitude of the modulated signal
All of the above
According to Shannon Hartley theorem,
The channel capacity becomes infinite with infinite bandwidth
The channel capacity does not become infinite with infinite bandwidth
Has a tradeoff between bandwidth and Signal to noise ratio
The channel capacity does not become infinite with infinite bandwidth and has a tradeoff between bandwidth and Signal to noise ratio
The channel capacity according to Shannon's equation is
Maximum error free communication
Defined for optimum system
Information transmitted
All of the above
The technique that may be used to increase average information per bit is
Shannon-Fano algorithm
ASK
FSK
Digital modulation techniques
Code rate r, k information bits and n as total bits, is defined as
r = k/n
k = n/r
r = k * n
n = r * k
Information rate is defined as
Information per unit time
Average number of bits of information per second
rH
All of the above
The mutual information
Is symmetric
Always non negative
Is symmetric & Always non negative
None of the above
Entropy is
Average information per message
Information in a signal
Amplitude of signal
All of the above
The memory less source refers to
No previous information
No message storage
Emitted message is independent of previous message
None of the above
The expected information contained in a message is called
Entropy
Efficiency
Coded signal
None of the above
In discrete memoryless source, the current letter produced by a source is statistically independent of _____
Past output
Future output
Past output & Future output
None of the above
Huffman coding technique is adopted for constructing the source code with ________ redundancy.
Maximum
Constant
Minimum
Unpredictable
Which type of channel does not represent any correlation between input and output symbols?
Noiseless Channel
Lossless Channel
Useless Channel
Deterministic Channel
In digital communication system, smaller the code rate, _________are the redundant bits.
less
more
equal
unpredictable
In channel coding theorem, channel capacity decides the _________permissible rate at which error free transmission is possible.
Maximum
Minimum
Constant
None of the above
According to Shannon's second theorem, it is not feasible to transmit information over the channel with ______error probability, although by using any coding technique.
small
large
stable
unpredictable
Which among the following is/are the essential condition/s for a good error control coding technique?
Faster coding & decoding methods
Better error correcting capability
Maximum transfer of information in bits/sec
All of the above
Shannon and Weaver’s (1949) model of communication has the following components: ______.
precontemplation, contemplation, preparation, action, maintenance
product, price, place, promotion
source, transmitter, channel, receiver, destination
none of these
Select the source coding techniques.
prefix coding
Shannon-fano coding
Huffman coding
All of the mentioned.
