Home › Quizzes › Coding Theory

Coding Theory

This quiz covers the fundamental concepts and techniques of Coding Theory, including error correction, data compression, and information theory.

13 Questions Published
Play Quiz Practise this topic out loud

Questions

Question 1 Multiple Choice (Single Answer)

In coding theory, what is the primary goal of a code?

  1. To minimize the number of bits required to represent a message.
  2. To maximize the number of errors that can be corrected.
  3. To ensure that the message is received exactly as it was sent.
  4. To minimize the time required to transmit a message.
Question 2 Multiple Choice (Single Answer)

What is the difference between a block code and a convolutional code?

  1. Block codes operate on fixed-length blocks of data, while convolutional codes operate on a continuous stream of data.
  2. Block codes are more efficient than convolutional codes.
  3. Convolutional codes are more robust to errors than block codes.
  4. Block codes are used for error correction, while convolutional codes are used for data compression.
Question 3 Multiple Choice (Single Answer)

What is the Hamming distance between two binary vectors?

  1. The number of positions in which the two vectors differ.
  2. The number of positions in which the two vectors are the same.
  3. The sum of the values of the two vectors.
  4. The product of the values of the two vectors.
Question 4 Multiple Choice (Single Answer)

What is the maximum number of errors that a Hamming code can correct?

  1. ⌊(n-1)/2⌋
  2. ⌊(n-1)/3⌋
  3. ⌊(n-1)/4⌋
  4. ⌊(n-1)/5⌋
Question 5 Multiple Choice (Single Answer)

What is the Shannon-Hartley theorem?

  1. It states that the capacity of a communication channel is given by C = B log2(1 + S/N), where C is the channel capacity, B is the bandwidth, S is the signal power, and N is the noise power.
  2. It states that the capacity of a communication channel is given by C = B log2(1 + S/N^2), where C is the channel capacity, B is the bandwidth, S is the signal power, and N is the noise power.
  3. It states that the capacity of a communication channel is given by C = B log2(1 + S/N^3), where C is the channel capacity, B is the bandwidth, S is the signal power, and N is the noise power.
  4. It states that the capacity of a communication channel is given by C = B log2(1 + S/N^4), where C is the channel capacity, B is the bandwidth, S is the signal power, and N is the noise power.
Question 6 Multiple Choice (Single Answer)

What is the Nyquist rate?

  1. The maximum rate at which data can be transmitted over a communication channel without distortion.
  2. The minimum rate at which data can be transmitted over a communication channel without distortion.
  3. The rate at which data is transmitted over a communication channel.
  4. The rate at which data is received over a communication channel.
Question 7 Multiple Choice (Single Answer)

What is the difference between lossless and lossy data compression?

  1. Lossless data compression reduces the size of a file without losing any information, while lossy data compression reduces the size of a file by discarding some information.
  2. Lossless data compression increases the size of a file, while lossy data compression decreases the size of a file.
  3. Lossless data compression is always better than lossy data compression.
  4. Lossy data compression is always better than lossless data compression.
Question 8 Multiple Choice (Single Answer)

What is the Huffman coding algorithm?

  1. A lossless data compression algorithm that uses a variable-length code to represent symbols.
  2. A lossy data compression algorithm that uses a variable-length code to represent symbols.
  3. A lossless data compression algorithm that uses a fixed-length code to represent symbols.
  4. A lossy data compression algorithm that uses a fixed-length code to represent symbols.
Question 9 Multiple Choice (Single Answer)

What is the Lempel-Ziv-Welch (LZW) algorithm?

  1. A lossless data compression algorithm that uses a dictionary to represent symbols.
  2. A lossy data compression algorithm that uses a dictionary to represent symbols.
  3. A lossless data compression algorithm that uses a Huffman code to represent symbols.
  4. A lossy data compression algorithm that uses a Huffman code to represent symbols.
Question 10 Multiple Choice (Single Answer)

What is the difference between entropy and information?

  1. Entropy is a measure of the uncertainty of a random variable, while information is a measure of the amount of information contained in a message.
  2. Entropy is a measure of the amount of information contained in a message, while information is a measure of the uncertainty of a random variable.
  3. Entropy and information are the same thing.
  4. Entropy and information are opposite things.
Question 11 Multiple Choice (Single Answer)

What is the entropy of a random variable?

  1. H(X) = -∑p(x) log2 p(x)
  2. H(X) = -∑p(x) log10 p(x)
  3. H(X) = -∑p(x) log2(1 - p(x))
  4. H(X) = -∑p(x) log10(1 - p(x))
Question 12 Multiple Choice (Single Answer)

What is the mutual information between two random variables?

  1. I(X;Y) = H(X) + H(Y) - H(X,Y)
  2. I(X;Y) = H(X) - H(Y) - H(X,Y)
  3. I(X;Y) = H(X) + H(Y) + H(X,Y)
  4. I(X;Y) = H(X) - H(Y) + H(X,Y)
Question 13 Multiple Choice (Single Answer)

What is the channel capacity of a communication channel?

  1. The maximum rate at which data can be transmitted over a communication channel without errors.
  2. The minimum rate at which data can be transmitted over a communication channel without errors.
  3. The rate at which data is transmitted over a communication channel.
  4. The rate at which data is received over a communication channel.
← Back to Quizzes