Exam 1: Data Representation

The following is a message that was originally encoded so that each pattern had odd parity.Circle the patterns in which an error has definitely occurred. 101110101 111110000 100010010 000000000 111111111 010001000 100111101 ______________________________________

Rewrite each of the following values (represented in base ten notation)in binary notation. A. 7 __________ B. 23 __________ C. 2 1/4 __________ D. 5/8 __________

Which of the following bit patterns (represented in hexadecimal notation)represents a positive number in two's complement notation?

Which of the following bit patterns represents the value 9 in two's complement notation?

Among the Boolean operations AND,OR,EXCLUSIVE OR,and NOT,which is least like the others? Explain your answer.

Which of the following is a means of encoding music?

Convert the following addition problem into two's complement notation (using four bits per value),perform the addition,convert the answer back into base ten notation,and explain the results. 6 +3

What is the result of the following addition problem (using two's complement notation)? 00001111 +10101010

Using a two's complement notation system in which each value is represented by a pattern of six bits,represent the value 5. ____________

How many errors in a single code pattern could be corrected when using an error-correcting code in which each code pattern is a Hamming distance of at least seven from any other code pattern? ____________

If a term paper consisted 42 pages,each containing 40 lines of 100 symbols each (counting each space as a symbol),was to be encoded using Unicode,how many bytes of storage space would be required?

Translate each of the following binary representations into its equivalent base ten representation. A. 1100 __________ B. 10.011 __________ C. 0.01 __________ D. 10001 __________

What is frequency-dependent encoding?

Which of the following provides a compressed representation of an image by limiting the number of different pixel colors to 256,thereby enabling each pixel in an image to be represented by a single byte whose value indicates which of a palette of entries represents the pixel's color?

Why is the rightmost bit in a string of bits considered to be the least significant bit?

Which of the following is the binary representation of 6 5/8?

What value is represented by each of the following patterns in excess notation? A. 10000 ____ B. 0110 ____ C. 1100 ____

Which of the following bit patterns (represented in hexadecimal notation)represents a negative number in two's complement notation?

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 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?