Questions and Answers of Essentials Of Computer Organization

Compute the Hamming distance of the following code 0011010010111100 0000011110001111 0010010110101101 0001011010011110
Compute the Hamming distance of the following code 0000000101111111 0000001010111111 0000010011011111 0000100011101111 0001000011110111 0010000011111011 0100000011111101 1000000011111110
Are the error-correcting Hamming codes systematic? Explain.
In defining the Hamming distance for a code, we choose to use the minimum (Hamming) distance between any two encodings. Explain why it would not be better to use the maximum or average distance.
Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10 a) How many parity bits are necessary? b) Assuming we are using the
Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How many parity bits are necessary? b) Assuming we are using the
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. We have already calculated that we need 5 check bits, and the
Find the quotients and remainders for the following division problems modulo 2 a) 10101112 + 11012 b) 10111112111012 10110011012 10101₂ d) 1110101112+ 10111₂ ÷
When would you choose a CRC code over a Hamming code? A Hamming code over a CRC?
Find the quotients and remainders for the following division problems modulo 2 a) 11110102 10112 b) 10101012 ÷ 1100₂ c) 11011010112+ 101012 d) 11111010112 ÷ 101101₂
Find the quotients and remainders for the following division problems modulo 2 ÷ 100112 a) 110010012 + 11012 b) 1011000₂ 111010112 101112 d) 111110001₂ ÷ 10012 ÷
Find the quotients and remainders for the following division problems modulo 2 a) 1001111211012 b) 1011110₂1100₂ c) 10011011102 + 110012 d) 111101010₂ 10011₂ ÷
Using the CRC polynomial 1011, compute the CRC code word for the information word 1011001. Check the division performed at the receiver.
Using the CRC polynomial 1101, compute the CRC code word for the information word 01001101. Check the division performed at the receiver.
Using the CRC polynomial 1101, compute the CRC code word for the information word 1100011. Check the division performed at the receiver.
We have seen that floating-point arithmetic is neither associative nor distributive. Why do you think this is the case?
Pick an architecture (such as 80486, Pentium, Pentium IV, SPARC, Alpha, or MIPS). Do research to find out how your architecture approaches the concepts introduced in this chapter. For example, what

Showing 700 - 800 of 718

1
2
3
4
5
6
7
8