ZuoTi.Pro
Question

Binary numbers A = 1100 1100 and B = 0001 0111 are signed integers (MSB is...

Binary numbers A = 1100 1100 and B = 0001 0111 are signed integers (MSB is the sign bit). Negative numbers are presented as 2’s complements. a) Show the most positive and the most negative numbers for 8-bit signed integers. Present both decimal and binary forms.

can some one explain the process of the solution?

engineering   Electrical-Engineering   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Request Professional Answer

Request Answer!

We need at least 10 more requests to produce the answer.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)

All students who have requested the answer will be notified once they are available.
Know the answer?
Add Answer to:
Binary numbers A = 1100 1100 and B = 0001 0111 are signed integers (MSB is...
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

Similar Homework Help Questions

  • Write out a table with signed binary numbers from 00002 to 11112 in one column and...

    Write out a table with signed binary numbers from 00002 to 11112 in one column and write the 2's complement of the numbers in the second column. In the third column write the signed decimal value of the numbers from the second column. Assume the MSB(Most Significant Bit) of the numbers in the first two columns is the sign bit (0= positive, 1= negative). Please Solve with Full steps Thank You.

  • Show all work. Define the following: 1. Bit 2. Byte 3. ASCII 4. Binary 5. Octal...

    Show all work. Define the following: 1. Bit 2. Byte 3. ASCII 4. Binary 5. Octal Convert the following binary numbers to decimal numbers: 1011 0111 0000 0001 1100 1000 0101 Convert the following numbers from decimal to binary: 0 4 9 3 17 8 7 Decode the following Binary ASCII text. Show your work. 01001001 00100000 01101100 01101111 01110110 01100101 00100000 01111001 01101111 01110101

  • Construct the 8-bit ripple-carry adder/subtractor for signed integers. Negative numbers are in th...

    Construct the 8-bit ripple-carry adder/subtractor for signed integers. Negative numbers are in the 2's complement form. The circuit has inputs X(7:0), Y(7:0), CO, M and outputs S(7:0), carry-out of MSB C8, OFL (OFL 1 when it occurs). The circuit should perform addition and subtraction of 8-bit signed numbers 2. with M-1 and M-0, respectively. a) Obtain the schematic for the 8-bit adder/subtractor with two 4-bit adder/subtractors from problem 1 as building blocks. X, Y, A, B, S can be shown...

  • Let D be the domain of 8-bit signed binary numbers, not mathematical integers. Is the following...

    Let D be the domain of 8-bit signed binary numbers, not mathematical integers. Is the following statement true? ∀x ∈ D, ∀y ∈ D, ((x > 0) ^ (y > 0)) → (x + y) > 0 Hint: bear in mind that the + here is addition over 8-bit signed binary numbers (clock arithmetic), NOT standard mathematical addition. Group of answer choices A. Definitely true. B. Definitely false. C. As is, can't tell, but I could tell with further information....

  • 2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...

    2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x 1011 3. Perform the following binary divisions, assuming unsigned integers: B. 10000001 / 101 C. 1001010010 / 1011 4. Assume we are using the simple model for floating-point representation as given in the text (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 16, a normalized mantissa of 8 bits, and single sign bit for the number ):...

  • 4) This exercise will first present the modified algorithm for computing the product of two numbers...

    4) This exercise will first present the modified algorithm for computing the product of two numbers represented in twos complement with an illustrated example and then ask you to repeat for a different number pair The hardware and the flowchart for signed multiplication in twos complement representation of binary numbers will be slightly modified as follows. Use the version of the unsigned multiplication hardware which employs one double-sized register to hold the partial product and the multiplier a. When shifting...

  • 101b= 2610, what is b?   How the following numbers will be represented in 4-bit (a) sign-magnitude...

    101b= 2610, what is b?   How the following numbers will be represented in 4-bit (a) sign-magnitude (b) two’s complement and (c) unsigned representations. Indicate if not possible. 2,  5,   7,   8   How the following negative numbers will be represented in 4-bit (a) sign-magnitude and b) two’s complement representations. Indicate if not possible. -2,     -5,   -7,  -8 Consider the following java program snippet (hint: byte is represented as 8-bit 2’s complement number in java- run the program in java to check it). What will be printed? Explain....

  • 1. Compute the decimal value for the following bit pattern, assuming it is a single-precision floating...

    1. Compute the decimal value for the following bit pattern, assuming it is a single-precision floating point number (show major steps): 1100 0011 0001 0010 0100 1001 0010 0100 2. Convert the decimal -2118.75 into single-precision floating point number (show major steps). 3. Assume -75 and -122 are signed decimal integers stored in 8-bit sign-magnitude binary format. Calculate -75 + -122. Is there overflow, underflow, or neither?

  • . 2.1 a.  Find the 16-bit 2’s complementary binary representation for the decimal number 1987. b.   Find...

    . 2.1 a.  Find the 16-bit 2’s complementary binary representation for the decimal number 1987. b.   Find the 16-bit 2’s complementary binary representation for the decimal number −1987. What are the 16-bit 1’s and 2’s complements of the following binary numbers? a.   10000 b.   100111100001001 Convert the decimal number 19557 to floating point. Use the format SEEMMMM. All digits are decimal. The exponent is stored excess-40 (not excess-50). The implied decimal point is at the beginning of the mantissa. The sign...

  • please explain steps!! Convert the boy binary floating point numbers below to decimal notation forseti 8...

    please explain steps!! Convert the boy binary floating point numbers below to decimal notation forseti 8 bits: SEEEEEFF and the bias is 7, where S-sign, E-Exponent acts on bits) 10 pt. / 5 pts es convert from 8 bit floating point binary format convert to: decimal +/-n.nn DS EEE (FFC - 0100 1.100 = -1,5 426 6 14.05 Yoryal = 15 +0111 1140=125 10110100 00111110 me floating point

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT