hello,
let us solve this question.
57 in 8 bit binary = 00111001
118 in 8 bit binary=01110110, so taking 2's complement of 118 will give binary of (-118)
so 2's complement of (01110110)=(10001001)+(00000001)=(10001010) i.e, binary of (-118)
now we can add binary of 57 and (-118):
(00111001)+(10001010)=(11000011) the left most bit in the answer is 1 which indicates it as a negative value , so we will take 2's complement of answer and the final answer will be -ve of 2's complement of (11000011)
2's complement of (11000011)=(00111100)+(00000001)=(00111101) which is 61 in decimal.
So the final answer is (-61)
i hope i was able to solve your problem to a greater extent, please feel free to comment your queries, Please consider my efforts and upvote my solution.
Thanku:)
3) [15] Convert -5610 to an 8-bit word in each of the following representations a) Signed magnitude (SM) b) Diminished radix complement (DRC) or ones complement c) Radix complement (RC) or twos complement
(1) Convert the decimal numbers +61 and +27 to their 8-bit 2's complement representations. Then perform the binary equivalent of (b) (27)+ (+61); and Convert the answers back to decimal and verify that they are correct.
In IEEE 754 32-bit representations, the significand of the fraction has ______ bits. a) 24 b) 23 c) 20 d) 16
e,f,g,h,i
1) Given: X 0xA4 and Y 0x95, a) Convert X and Y to 8-bit binary numbers. b) Compute the 8-bit sum X+Y of X and Y o) Compute Y the 8-bit two's complement of Y. d) Compute the 8-bit difference X"Y of X and Y. (Use two's complement addition.) o) Convert XiY, Y, and, X Y to hexadecimal. D What are the values of the condition flags z n c v upon computing X-+Y? g) What are the values...
Please show work, thanks.
Consider the following two 16-bit floating-point representations 1. Format A. There is one sign bit There are k 6 exponent bits. The exponent bias is 31 (011111) There are n 9 fraction/mantissa bits 2. Format B There is one sign bit There are k 5 exponent bits. The exponent bias is 15 (01111) There are n 10 fraction/mantissa bits Problem 1 (81 points total /3 points per blank) Below, you are given some bit patterns in...
1. (a) Convert the following decimal numbers into their EEE-754 single-precision (32-bit) representations. Give your answers in hexadecimal form. (12 marks) (1)-3.3125 () (11) 522240 6) Convert the following IEEE 754 single-precision numbers in hexadecimal into their decimal values accurate to 5 significant figures. (8 marks) (1) 0x800E0000 (1) Ox9FACE600
I would like a step by step explanation as to how the 7-bit floating point representations from Format A were converted to Format B. Thanks. Consider the following two 7-bit floating point representations based on the IEEE floating point format. Neither has a sign bit - they can only represent non-negative numbers. i). Format A. There are k=3 exponent bits. The exponent bias is 3. There are n=4 fraction bits. ii). Format B. There are k=4 exponent bits. The exponent...
Design and Test an 8-bit Adder using 4-bit adder. Use 4-bit adder coded in class using full adder that is coded using data flow model. Use test bench to test 8-bit adder and consider at least five different test vectors to test it.
Show your work. For 8-bit numbers, use 1 sign bit, 3 exponent bits, 4 mantissa bits: 1.)Convert 11.0 to 8-bit floating point format 2.)Convert -12.40625 to 8-bit floating point format For 32-bit numbers, use 1 sign bit, 8 exponent bits, 23 mantissa bits: 3.)Convert 119.59375 to 32-bit floating point format 4.)Convert -67.1015625 to 32-bit floating point format
Use 8-bit two’s complement code to do the addition (+18)+(+25)= Use 4-bit two’s complement code to do the subtraction (+3)-(+6)=