Question 1

How many errors per pattern could be corrected when using an error-correcting code in which any two code patterns differ by a Hamming distance of 8?

Accepted Answer

A)  3 
B)  4 
C)  5 
D)  6

Question 2

Which of the following representations in two's complement notation represents the largest value?

Accepted Answer

A)  00000010 
B)  11111111 
C)  00000001 
D)  11111110

Question 3

Which of the following bit-patterns represents the smallest value using the floating-point format in which the most significant bit is the sign bit,the next three bits represent the exponent field in excess notation,and the last four bits represent the mantissa?

Accepted Answer

A)  01001000 
B)  01011000 
C)  00101000 
D)  01111000

Exam 2: Data Representation

How many errors per pattern could be corrected when using an error-correcting code in which any two code patterns differ by a Hamming distance of 8?

Which of the following representations in two's complement notation represents the largest value?

Which of the following bit-patterns represents the smallest value using the floating-point format in which the most significant bit is the sign bit,the next three bits represent the exponent field in excess notation,and the last four bits represent the mantissa?