StreakPeaked· Practice

ExamsGATEEngineering Mathematics

Let H(X) denote the entropy of a discrete random variable X taking K possible distinct real values. Which of the following statements is/are necessarily true?

  1. H(X) ≤ log₂ K bits
  2. H(X) ≤ H(2X)
  3. H(X) ≤ H(X²)
  4. H(X) ≤ H(2^X)

Correct answer: H(X) ≤ log₂ K bits

Solution

The entropy H(X) measures the uncertainty in a random variable X, and it is maximized when all K outcomes are equally likely. Therefore, the maximum entropy is log₂ K bits, which means H(X) cannot exceed this value.

Related GATE Engineering Mathematics questions

⚔️ Practice GATE Engineering Mathematics free + battle 1v1 →