Scribd
Upload
22 views3 pages

Test Information and Coding Theory

The document presents fundamental concepts in information theory and error correction, including key terms such as bits, Shannon's entropy, and mutual information. It discusses the purpose of error-correcting codes, Hamming codes, and data compression, along with the role of redundancy and channel coding. The content is structured as a quiz with multiple-choice questions aimed at testing knowledge in these areas.

Uploaded by

riyadqhrmanli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views3 pages

Test Information and Coding Theory

The document presents fundamental concepts in information theory and error correction, including key terms such as bits, Shannon's entropy, and mutual information. It discusses the purpose of error-correcting codes, Hamming codes, and data compression, along with the role of redundancy and channel coding. The content is structured as a quiz with multiple-choice questions aimed at testing knowledge in these areas.

Uploaded by

riyadqhrmanli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1–8: Fundamental Concepts in Information Theory

1. What is the unit of information in information theory?


o a) Bit
o b) Byte
o c) Block
o d) Frame

2. What is Shannon’s entropy?


o a) A measure of data size
o b) A measure of uncertainty in a random variable
o c) A measure of compression ratio
o d) A measure of encryption strength

3. What is the entropy of a fair coin toss?


o a) 0 bit
o b) 1 bit
o c) 2 bits
o d) 0.5 bit

4. Which theorem states that reliable communication is possible over a


noisy channel up to a certain capacity?
o a) Shannon’s Channel Capacity Theorem
o b) Noisy Channel Theorem
o c) Hamming Code Theorem
o d) Nyquist-Shannon Sampling Theorem

5. Which of the following statements about mutual information is true?


o a) It measures the dependency between two variables.
o b) It measures the compression ratio of a source.
o c) It measures the maximum data rate of a channel.
o d) It measures the noise level in a signal.

6. What is the redundancy of a message?


o a) The number of extra bits required to correct errors
o b) The difference between the actual message length and its entropy
o c) The compression ratio of the message
o d) The probability of error in transmission

7. What is source coding?


o a) A method to add redundancy for error correction
o b) A method to compress information efficiently
o c) A way to encrypt data before transmission
o d) A technique for modulation in communication systems
8. Which of the following is an example of lossless compression?
 a) JPEG
 b) MP3
 c) Huffman coding
 d) MPEG

9–16: Error Correction and Coding Theory

9. What is the purpose of error-correcting codes?


 a) To increase the speed of data transmission
 b) To reduce the data size for storage
 c) To detect and correct errors in transmitted data
 d) To enhance encryption strength

10. What is a Hamming code?


 a) A symmetric encryption algorithm
 b) A type of compression technique
 c) An error-detecting and correcting code
 d) A modulation scheme for wireless communication

11. What is a "block length" in coding theory?


 a) The total length of a codeword
 b) The number of symbols in a codeword
 c) The length of the data packet
 d) The amount of redundancy in a message

12. What is the main purpose of data compression?


 a) To secure data through encryption
 b) To reduce the amount of data required for transmission or storage
 c) To enhance data integrity
 d) To increase the speed of data access

13. What is the minimum Hamming distance required to detect 1-bit


errors?
 a) 1
 b) 2
 c) 3
 d) 4

14. Which error-correcting code is known for adding minimal redundancy?


 a) Reed-Solomon code
 b) Hamming code
 c) Parity bit code
 d) Convolutional code
15. What is the role of the parity bit in error detection?
 a) To compress data for transmission
 b) To indicate whether the number of 1s in a message is even or odd
 c) To encrypt the message
 d) To increase the speed of data transfer

16. What is the goal of channel coding?


 a) To encrypt the data for security
 b) To reduce the bandwidth requirement
 c) To detect and correct errors during transmission
 d) To increase the signal-to-noise ratio

You might also like