Assuming we are using the Hamming algorithm presented in your text and even
parity to design an error-correcting code, find the code word to represent the 8-bit
information word 01001000. - Answer- 000110011000
Using the CRC polynomial 1001, create the CRC code word for the information word
01010101. - Answer- 01010101110
The binary string 01000110001000 is a floating point number expressed using the
14-bit simple model given in your text. (There are no implied bits.) What is its
decimal equivalent? - Answer- 2.125
The binary string 01001010001100 is a floating point number expressed using the
14-bit simple model given in your text. (There are no implied bits.) What is its
decimal equivalent? - Answer- 4.375
Given the following two binary numbers: 11111100 and 01110000 Which of these
two numbers is the larger unsigned binary number? - Answer- 11111100
Given the following two binary numbers: 11111100 and 01110000 Which of these
two is the larger when it is being interpreted on a computer using signed-two's
complement representation? - Answer- 01110000
Given the following two binary numbers: 11111100 and 01110000 Which of these
two is the smaller when it is being interpreted on a computer using signed-magnitude
representation? - Answer- 11111100
What decimal value does the 8-bit binary number 10110100 have if: it is interpreted
as an unsigned number? - Answer- 180
What decimal value does the 8-bit binary number 10110100 have if: it is on a
computer using signed-magnitude representation? - Answer- -52
, What decimal value does the 8-bit binary number 10110100 have if: it is on a
computer using one's complement representation? - Answer- -75
What decimal value does the 8-bit binary number 10110100 have if: it is on a
computer using two's complement representation? - Answer- -76
What decimal value does the 8-bit binary number 10110100 have if: it is on a
computer using excess-127 representation? - Answer- 53
Add the following unsigned binary number as shown.01000100 +
10111011---------------- - Answer- 11111111
Subtract the following signed binary numbers as shown using 2's complement
arithmetic. 11000100- 00111011------------------- - Answer- 10001001
Perform the following binary multiplication, assuming unsigned integers:1011X
101------- - Answer- 00110111
Perform the following binary divisions, assuming unsigned integers:11111101/1011 -
Answer- 11010
Show how the following floating point values would be stored using IEEE-754 double
precision (be sure to indicate the sign bit, the exponent, and the significand fields): it
is 12.5 - Answer- 0 10000000010 1001000...0
Show how the following floating point values would be stored using IEEE-754 double
precision (be sure to indicate the sign bit, the exponent, and the significand fields): it
is -1. 5 - Answer- 1 01111111111 1000000...0
Show how the following floating point values would be stored using IEEE-754 double
precision (be sure to indicate the sign bit, the exponent, and the significand fields): it
is .75 - Answer- 0 01111111110 1000000...0
Show how the following floating point values would be stored using IEEE-754 double
precision (be sure to indicate the sign bit, the exponent, and the significand fields): it
is 26.265 - Answer- 0 10000000011 1010101...0
The ASCII code for the letter A is 1000001, and the ASCII code for the letter a is
1100001. Given that the ASCII code for the letter G is 1000111, without looking at
Table 2.7, what isthe ASCII code for the letter g? - Answer- 1100111
The Boolean AND operation is also known as - Answer- Boolean product
Which of the following equations correctly reflects the truth table shown below? -
Answer- x'yz' + x'yz + xy'z' + xyz' + xyz
The truth table shown below is supposed to reflect the function F(x, y, z) = y(x + z')
but two lines are in error. Identify them. - Answer- 3 and 4
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Freshy. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $12.49. You're not tied to anything after your purchase.
