# Shannon's Theorem and Shannon's bound - MCQs with answers

## Shannon's Theorem and Shannon's bound - MCQs with answers

Q1. For a binary symmetric channel, the random bits are given as

a) Logic 1 given by probability P and logic 0 by (1-P)
b) Logic 1 given by probability 1-P and logic 0 by P
c) Logic 1 given by probability P2 and logic 0 by 1-P
d) Logic 1 given by probability P and logic 0 by (1-P)2

ANSWER: a) Logic 1 given by probability P and logic 0 by (1-P)

Q2. The channel capacity according to Shannon's equation is

a) Maximum error free communication
b) Defined for optimum system
c) Information transmitted
d) All of the above

ANSWER: d) All of the above

Q3. For M equally likely messages, M>>1, if the rate of information R > C, the probability of error is

a) Arbitrarily small
b) Close to unity
c) Not predictable
d) Unknown

Q4. For M equally likely messages, M>>1, if the rate of information R <= C, the probability of error is

a) Arbitrarily small
b) Close to unity
c) Not predictable
d) Unknown

Q5. The negative statement for Shannon's theorem states that

a) If R > C, the error probability increases towards Unity
b) If R < C, the error probability is very small
c) None of the above
d) Not applicable

ANSWER: a) If R>C, the error probability increases towards Unity

Q6. According to Shannon Hartley theorem,

a) the channel capacity becomes infinite with infinite bandwidth

b) the channel capacity does not become infinite with infinite bandwidth

c) Has a tradeoff between bandwidth and Signal to noise ratio

d) Both b) and c) are correct