Question

Show each step to find the 8-bit representation of -3310

Show each step to find the 8-bit representation of -3310

Engineering   Electrical-Engineering   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1
  • There are total of 3 methods (1)signed magnitude (2) signed 1's complement (3) signed 2's complement.

Although nowadays computers used signed 2's complement to store negative numbers. so using this I solved.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Translate the base 10 value -45 into 8-bit two's complement representation.
Translate the base 10 value -45 into 8-bit two's complement representation.
Matlab uses IEEE double precision numbers: 64-bit floating point representation 1 bit : sign 11 bits:...
Matlab uses IEEE double precision numbers: 64-bit floating point representation 1 bit : sign 11 bits: exponent 52 bits: mantissa. Calculate largest number (less than inf) that can be stored accurately Calculate smallest number (x>0) that can be stored accurately Calculate the machine epsilon Show all work step by step and repeat for 10 bit floating point (bit sign, 4 bits exponent and 5 bits mantissa)
Matlab uses IEEE double precision numbers: 64-bit floating point representation 1 bit : sign 11 bits:...
Matlab uses IEEE double precision numbers: 64-bit floating point representation 1 bit : sign 11 bits: exponent 52 bits: mantissa. Calculate largest number that can be stored accurately Calculate smallest number (x>0) that can be stored accurately Calculate the machine epsilon Show all work step by step and explain calculations Now calculate the largest number and smallest number for a 10 bit floating point (1 bit for the sign, 4 bits exponent and 5 bits mantissa)
Using the IEEE single-precision floating point representation, find the decimal number represented by the following 32-bit...
Using the IEEE single-precision floating point representation, find the decimal number represented by the following 32-bit numbers, each expressed as an 8-digit hex number. Express your answer using decimal scientific notation. (a) (C6500000)16 (b) (31200000)16
Find the two’s complement representation for the following numbers, assuming they are represented as a 16-bit...
Find the two’s complement representation for the following numbers, assuming they are represented as a 16-bit number. Write the value in both binary and hexadecimal for full credit. a. -72 b. 1314 c. 594 d. -1194
What is the 16-bit binary representation (in hexadecimal using lower-case letters, e.g., 0x39ab) of -13 1/4...
What is the 16-bit binary representation (in hexadecimal using lower-case letters, e.g., 0x39ab) of -13 1/4 (base 10) when represented as an IEEE 16-bit floating-point number? The IEEE 16-bit floating-point representation uses formulae consistent with those for the 32bit single-precision representation, except for using 5 bits for the exponent (instead of 8 in the case of the 32-bit representation) and a bias of 15.
Assuming nine-bit 2’s complement representation, convert the decimal number -137 to binary, show the effect of...
Assuming nine-bit 2’s complement representation, convert the decimal number -137 to binary, show the effect of the ROL operation on it with initial carry C=1, show the status bits and then convert the result back to decimal. Repeat with the ASR operation. Write the RTL specification of both operations shown here.
Assume a computer is using signed magnitude base 2 representation to store 8-bit values. Further, assume...
Assume a computer is using signed magnitude base 2 representation to store 8-bit values. Further, assume you have a program which can display the contents of 1-byte memory locations. However, the program displays hex (as a shorthand) instead of binary. What decimal values are represented by the following: (a) C3 (b) 6E Repeat the above, but assume the numbers are stored as 8-bit 2’s complement base 2.
Q1) (8%) Show a leftmost derivation step by step (each step on a single line)          ...
Q1) (8%) Show a leftmost derivation step by step (each step on a single line)           for the statement: A = A + B * C using the following grammar: <assign> --> <id> = <expr> <expr>    --> <id> + <expr> | <id> * <expr> |   <id> <id>         --> A | B | C Q2) (6%) Is this grammar ambiguous (Yes or No?) Justify your answer. Q3) (6%) Does this grammar enforce the precedence of the conventional operators  (Yes or No?)   Justify...
Concern the following 16-bit floating point representation: The first bit is the sign of the number...
Concern the following 16-bit floating point representation: The first bit is the sign of the number (0 = +, 1 = -), the next nine bits are the mantissa, the next bit is the sign of the exponent, and the last five bits are the magnitude of the exponent. All numbers are normalized, i.e. the first bit of the mantissa is one, except for zero which is all zeros. 1. How many significant binary digits do numbers in this representation...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT