My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Information Theory - Communications - Electronics & Communication Engineering Previous Year Questions

Practice Information Theory - Communications - Electronics & Communication Engineering previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

23Papers
15Years
34Questions
1Topics

Information Theory question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Easy 20 58.8%
Medium 13 38.2%
Hard 1 2.9%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 16 47.1%
Numerical Answer Type (NAT) 15 44.1%
MSQ 2 5.9%
Fill in the blanks 1 2.9%

Subject weightage

Top subjects by unique question coverage.

Electronics & Communication Engineering
34 Qs

Most asked topics

Top topics across the included previous year papers.

Communications
34 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Information Theory
34 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Electronics and Communication Engineering (EC) 2026
1 Qs
Electronics & Communication Engineering (EC) 2025
3 Qs
Electronics & Communication Engineering (EC) 2024
1 Qs
Electronics & Communication Engineering (EC) 2023
1 Qs
Electronics & Communication Engineering (EC) 2022
4 Qs
Electronics & Communication Engineering (EC) 2021
1 Qs
Electronics & Communication Engineering (EC) 2020
1 Qs
Electronics & Communication Engineering (EC) 2017
2 Qs
Electronics & Communication Engineering (EC) 2017 [Session 2]
2 Qs
Electronics & Communication Engineering (EC) 2017 [Session 1]
1 Qs
Electronics & Communication Engineering (EC) 2016 [Session 3]
3 Qs
Electronics & Communication Engineering (EC) 2016 [Session 2]
2 Qs
Electronics & Communication Engineering (EC) 2016 [Session 1]
1 Qs
Electronics & Communication Engineering (EC) 2014 [Session 2]
1 Qs
Electronics & Communication Engineering (EC) 2014 [Session 4]
1 Qs
Electronics & Communication Engineering (EC) 2013 [Session 1]
1 Qs
Electronics & Communication Engineering (EC) 2013 [Session 2]
1 Qs
Electronics & Communication Engineering (EC) 2013 [Session 3]
1 Qs
Electronics & Communication Engineering (EC) 2013 [Session 4]
1 Qs
Electronics & Communication Engineering (EC) 2012
2 Qs
Electronics & Communication Engineering (EC) 2011
1 Qs
Electronics & Communication Engineering (EC) 2009
1 Qs
Electronics & Communication Engineering (EC) 2008
1 Qs

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Electronics and Communication Engineering (EC) 20262026
1 questions in this view
2026
Electronics & Communication Engineering (EC) 20252025
3 questions in this view
2025
Electronics & Communication Engineering (EC) 20242024
1 questions in this view
2024
Electronics & Communication Engineering (EC) 20232023
1 questions in this view
2023
Electronics & Communication Engineering (EC) 20222022
4 questions in this view
2022
Electronics & Communication Engineering (EC) 20212021
1 questions in this view
2021
Electronics & Communication Engineering (EC) 20202020
1 questions in this view
2020
Electronics & Communication Engineering (EC) 20172017
2 questions in this view
2017
Electronics & Communication Engineering (EC) 2017 [Session 1]2017
1 questions in this view
2017
Electronics & Communication Engineering (EC) 2017 [Session 2]2017
2 questions in this view
2017
Electronics & Communication Engineering (EC) 2016 [Session 1]2016
1 questions in this view
2016
Electronics & Communication Engineering (EC) 2016 [Session 2]2016
2 questions in this view
2016
Electronics & Communication Engineering (EC) 2016 [Session 3]2016
3 questions in this view
2016
Electronics & Communication Engineering (EC) 2014 [Session 2]2014
1 questions in this view
2014
Electronics & Communication Engineering (EC) 2014 [Session 4]2014
1 questions in this view
2014
Electronics & Communication Engineering (EC) 2013 [Session 1]2013
1 questions in this view
2013
Electronics & Communication Engineering (EC) 2013 [Session 2]2013
1 questions in this view
2013
Electronics & Communication Engineering (EC) 2013 [Session 3]2013
1 questions in this view
2013
Electronics & Communication Engineering (EC) 2013 [Session 4]2013
1 questions in this view
2013
Electronics & Communication Engineering (EC) 20122012
2 questions in this view
2012
Electronics & Communication Engineering (EC) 20112011
1 questions in this view
2011
Electronics & Communication Engineering (EC) 20092009
1 questions in this view
2009
Electronics & Communication Engineering (EC) 20082008
1 questions in this view
2008

All Information Theory previous year questions

Practice every matching question in batches of 20, with every available option.

1
2008 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2008
A memoryless source emits n symbols each with a probability p. The entropy of the source as a function of n
Open complete paper
2
2009 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2009

A communication channel with AWGN operating at a signal to noise ratio SNR >> 1 and bandwidth B has capacity C1. If the SNR is doubled keeping B constant, the resulting capacity C2 is given by

Open complete paper
3
2011 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2011
An analog signal is band-limited to 4 kHz, sampled at the Nyquist rate and the samples are quantized into 4 levels. The quantized levels are assumed to be independent and equally probable. If we transmit two quantized samples per second, the information rate is
Open complete paper
4
2012 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2012
A source alphabet consists of N symbols with the probability of the first two symbols being the same. A source encoder increases the probability of the first symbol by a small amount \(\epsilon\) and decreases that of the second by \(\epsilon\). After encoding, the entropy of the source
Open complete paper
5
2012 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2012

A binary symmetric channel (BSC) has a transition probability of 1/8. If the binary transmit symbol X is such that P(X=0) = 9/10, then the probability of error for an optimum receiver will be

Open complete paper
6
2013 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2013 [Session 1]
Let \(U\) and \(V\) be two independent and identically distributed random variables such that \(P(U = +1) = P(U = -1) = \frac{1}{2}\). The entropy \(H(U + V)\) in bits is
Open complete paper
7
2013 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2013 [Session 2]
Let U and V be two independent and identically distributed random variables such that P(U = +1) = P(U = -1) = 1/2. The entropy H(U + V) in bits is
Open complete paper
8
2013 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2013 [Session 3]
Let U and V be two independent and identically distributed random variables such that \(P(U = +1) = P(U = -1) = \frac{1}{2}\). The entropy \(H(U + V)\) in bits is
Open complete paper
9
2013 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2013 [Session 4]
Let \( U \) and \( V \) be two independent and identically distributed random variables such that \( P(U = +1) = P(U = -1) = \frac{1}{2} \). The entropy \( H(U + V) \) in bits is
Open complete paper
10
2014 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2014 [Session 2]
The capacity of a band-limited additive white Gaussian noise (AWGN) channel is given by $C = W \log_2 \left(1 + \frac{P}{\sigma^2 W}\right)$ bits per second (bps), where $W$ is the channel bandwidth, $P$ is the average power received and $\sigma^2$ is the one-sided power spectral density of the AWGN.
For a fixed $\frac{P}{\sigma^2} = 1000$, the channel capacity (in kbps) with infinite bandwidth ($W \to \infty$) is approximately
Open complete paper
11
2014 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2014 [Session 4]
Consider the Z-channel given in the figure. The input is 0 or 1 with equal probability.

If the output is 0, the probability that the input is also 0 equals __________
Open complete paper
12
2016 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2016 [Session 1]
Consider a discrete memoryless source with alphabet \( S = \{s_0, s_1, s_2, s_3, s_4, ... \} \) and respective probabilities of occurrence \( P = \left\{ \frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \frac{1}{16}, \frac{1}{32}, ... \right\} \). The entropy of the source (in bits) is __________
Open complete paper
13
2016 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2016 [Session 2]
A discrete memoryless source has an alphabet \( \{a_1, a_2, a_3, a_4\} \) with corresponding probabilities \( \left\{\frac{1}{2}, \frac{1}{3}, \frac{1}{9}, \frac{1}{18}\right\} \). The minimum required average codeword length in bits to represent this source for error-free reconstruction is ______
Open complete paper
14
2016 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2016 [Session 2]
A binary communication system makes use of the symbols "zero" and "one". There are channel errors. Consider the following events:
\(x_0\) : a "zero" is transmitted
\(x_1\) : a "one" is transmitted
\(y_0\) : a "zero" is received
\(y_1\) : a "one" is received
The following probabilities are given: \(P(x_0) = \frac{1}{2}\), \(P(y_0|x_0) = \frac{3}{4}\), and \(P(y_0|x_1) = \frac{1}{2}\). The information in bits that you obtain when you learn which symbol has been received (while you know that a "zero" has been transmitted) is ________
Open complete paper
15
2016 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2016 [Session 3]
An analog baseband signal, bandlimited to 100 Hz, is sampled at the Nyquist rate. The samples are quantized into four message symbols that occur independently with probabilities \( p_1 = p_4 = 0.125 \) and \( p_2 = p_3 \). The information rate (bits/sec) of the message source is _____________
Open complete paper
16
2016 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2016 [Session 3]
A voice-grade AWGN (additive white Gaussian noise) telephone channel has a bandwidth of 4.0 kHz and two-sided noise power spectral density \[\frac{\eta}{2} = 2.5 \times 10^{-5} \text{ Watt per Hz.}\] If information at the rate of 52 kbps is to be transmitted over this channel with arbitrarily small bit error rate, then the minimum bit-energy \(E_b\) (in mJ/bit) necessary is __________
Open complete paper
17
2016 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2016 [Session 3]
The bit error probability of a memoryless binary symmetric channel is \(10^{-5}\). If \(10^5\) bits are sent over this channel, then the probability that not more than one bit will be in error is __________
Open complete paper
18
2017 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2017
Correct: 1 Wrong: -0.33

Which one of the following graphs shows the Shannon capacity (channel capacity) in bits of a memoryless binary symmetric channel with crossover probability p?

Open complete paper
19
2017 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2017

Consider a binary memoryless channel characterized by the transition probability diagram shown in the figure. The channel is

Open complete paper
20
2020 · Electronics & Communication Engineering · Communications · Information Theory
Electronics & Communication Engineering (EC) 2020
A binary random variable X takes the value +2 or −2. The probability P(X = +2) = α. The value of α (rounded off to one decimal place), for which the entropy of X is maximum, is __________.
Open complete paper

Showing 20 of 34 questions