Question

Chapter 1. problem 7: (5+5 pts)Tbe following 6-bit twos complement numbers were found in a computer. What decimal number do they represent? f) 111001 Chapter 1.problem 9: (10 pts) Each of the following pairs of signed (twos complement) integers are stored in computer words (6 bits). Compute the sum as it is stored in a 6-bit computer word. Show the decimal equivalent of each operand and the sum. Indicate if there is overflow a) 110101 001111

0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
Chapter 1. problem 7: (5+5 pts)Tbe following 6-bit two's complement numbers were found in a computer....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 2. Convert the following two's complement binary numbers to decimal numbers. These numbers are integers.

    2. Convert the following two's complement binary numbers to decimal numbers. These numbers are integers. a. 110101 b. 01101010 c. 10110101 3. Convert the following decimal numbers to 6-bit two's complement binary numbers and add them. Write the results in 6-bit two's complement binary number format and decimal number format. Indicate whether or not the sum overflows a 6-bit result. a. 14 + 12 b. 30 + 2 C. -7 + 20 d. -18-17 4. What is the signed/magnitude and two's complement range of...

  • 1. What is the largest decimal number we can represent with a 16 bit two's complement...

    1. What is the largest decimal number we can represent with a 16 bit two's complement number? 2. Convert the following signed binary numbers to decimals. 11001         010011            1110100            1100111           3. Convert the following decimal numbers to 6-bit two's complement binary numbers and add them. Note if there is an overflow. 7 + 13 Two's complement/binary number for 7: Two's complement/binary number for 13: Sum: Overflow? 4. Convert the following decimal numbers to 6-bit two's complement binary numbers...

  • Convert the following decimal numbers to 6-bit two's complement binary number and add them. Keep result...

    Convert the following decimal numbers to 6-bit two's complement binary number and add them. Keep result in binary form. Enter yes/no for any overflows (overflows only, not carried bits). 16 + 9 .............. Overflow?................... 27 + 31 .............. Overflow?....................... (-4) + 19 .............. Overflow? ........................ 3 + (-32) ............ Overflow? ........................ (-16) + (-9) ............... Overflow? .............................. (-27) + (-31) ................ Overflow? ...........................................

  • Problem 2. Signed numbers using the two's complement applies also for fractional parts. That is, ignoring...

    Problem 2. Signed numbers using the two's complement applies also for fractional parts. That is, ignoring the decimal point, the logical words that "A" and A" are two's complements of each other. With this in mind., T following numbers in binary, hexadecimal and octal notations with represent. b.-735.75 c. -312.325 with eight digits in the fractional part

  • (5 points) Convert the following decimal numbers to 8-bit two's complement binary numbers and carry out...

    (5 points) Convert the following decimal numbers to 8-bit two's complement binary numbers and carry out the additions in binary. Indicate whether the sum overflows the 8-bit result. If not show the result as a decimal number. a) 39 + (-78) b) -43 + (-92)

  • 6 - What decimal number does the bit pattern 0xC0B00000 represent if it is: • [2...

    6 - What decimal number does the bit pattern 0xC0B00000 represent if it is: • [2 pts] A two's complement integer? • [2 pts] An unsigned integer? • [2 pts] A floating point number assuming the IEE 754 single precision format 7 - Perform the following calculations assuming that the values are 8-bit decimal integers stored in two's complement format. Be sure to consider the possibility of overflow. • [2 pts] 10101010 + 00110011 • [2 pts] 10101010 – 00110011...

  • Convert the following two's domplement binary numbers to decimal. 100101 -5 27 -27 Question 2 (4...

    Convert the following two's domplement binary numbers to decimal. 100101 -5 27 -27 Question 2 (4 points) Convert the following two's complement binary numbers to decimal. 100011 -29 36 -3 28 Question 3 (4 points) Convert the following decimal numbers to 6-bit two's complement binary numbers and add them. Indicate whether or not the sum overflows a 6-bit result. 011001+011011 110100; no overflow 100111 100101-001100; overflovw 100110 100100 001010; overflow 100111 + 100101 -001100; no overflow Question 4 (4 points)...

  • 3. Use 6 bits (2's complement representation) to solve the following problem. Indicate any overflow. a....

    3. Use 6 bits (2's complement representation) to solve the following problem. Indicate any overflow. a. Convert decimal +16 and +21 to binary. (5 pts.) b. Perform the binary equivalent of (+16) + (-21) (3 pt.) c. Perform the binary equivalent of (-16)+(-21) (3 pts.)

  • (3 pts) Consider an unsigned fixed point decimal (Base10) representation with 8 digits, 5 to the...

    (3 pts) Consider an unsigned fixed point decimal (Base10) representation with 8 digits, 5 to the left of the decimal point and 3 to the right. a.      What is the range of the expressible numbers?    b.      What is the precision?    c.       What is the error?    ______________________________________________________________________________   (3 pts) Convert this unsigned base 2 number, 1001 10112, to each base given below   (Note: the space in the binary string is purely for visual convenience) Show your work. Using...

  • 6. In this problem, you are to implement a 3-bit ALU which performs the following 4 operations on 3-bit operands A and B and generates the result F and the overflow status OV: (a) op(1:0) 00: A A...

    6. In this problem, you are to implement a 3-bit ALU which performs the following 4 operations on 3-bit operands A and B and generates the result F and the overflow status OV: (a) op(1:0) 00: A AND B (b) op(1:0)#: 01 : A OR B. (c)op(1:0),# 10: A +13. (d) 01, (1 : 0) t# 11 : A B, For arithmetic operations, assume that A and B are two's complement integers, e.g.. 0112 3, n and 1002 ten The...

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