Information and Coding MCQ

Test your knowledge with important Information and Coding MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Information and Coding MCQs at Bissoy

• Coded system are inherently capable of better transmission efficiency than the uncoded system.
  ক

  True

  খ

  False
• Lempel-Ziv algorithm is
  ক

  Variable to fixed length algorithm

  খ

  Fixed to variable length algorithm

  গ

  Fixed to fixed length algorithm

  ঘ

  Variable to variable length algorithm
• Entropy of a random variable is
  ক

  0

  খ

  1

  গ

  Infinite

  ঘ

  Cannot be determined
• The self information of random variable is
  ক

  0

  খ

  1

  গ

  Infinite

  ঘ

  Cannot be determined
• When X and Y are statistically independent, then I (x,y) is
  ক

  1

  খ

  0

  গ

  Ln 2

  ঘ

  Cannot be determined
• When the base of the logarithm is 2, then the unit of measure of information is
  ক

  Bits

  খ

  Bytes

  গ

  Nats

  ঘ

  None of the mentioned
• The method of converting a word to stream of bits is called as
  ক

  Binary coding

  খ

  Source coding

  গ

  Bit coding

  ঘ

  Cipher coding
• The event with minimum probability has least number of bits.
  ক

  True

  খ

  False
• Binary Huffman coding is a
  ক

  Prefix condition code

  খ

  Suffix condition code

  গ

  Prefix & Suffix condition code

  ঘ

  None of the mentioned
• When probability of error during transmission is 0.5, it indicates that
  ক

  Channel is very noisy

  খ

  No information is received

  গ

  Channel is very noisy & No information is received

  ঘ

  None of the mentioned
• The unit of average mutual information is
  ক

  Bits

  খ

  Bytes

  গ

  Bits per symbol

  ঘ

  Bytes per symbol
• Self information should be
  ক

  Positive

  খ

  Negative

  গ

  Positive & Negative

  ঘ

  None of the mentioned