`1) How is -9 (base 10) represented in 8-bit two's complement notation?
a) 00001001
b)11110111
c)11110110
d) 11111001
2) The binary addition of 1 + 1 + 1 + 1 =
A) 1111(base 2)
b) 0001(base2)
C) 0100(base2)
D) 1001(base2)
3) How is –1 (base 10) represented in 8-bit two's complement notation?
A) 1111111-
B) 111111111
C) 00000001
D) 00000010
Answer: -------- 1) b. 11110111 2) c. 0100(base2) 3) 11111111 Explanation: ------------- 1) This is negative. so, follow these steps to convert this into a 2's complement binary Step 1: Divide 9 successively by 2 until the quotient is 0 > 9/2 = 4, remainder is 1 > 4/2 = 2, remainder is 0 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 1001 So, 9 of decimal is 1001 in binary Adding 4 zeros on left hand side of this number to make this of length 8 So, 9 in normal binary is 00001001 Step 2: flip all the bits. Flip all 0's to 1 and all 1's to 0. 00001001 is flipped to 11110110 Step 3:. Add 1 to above result 11110110 + 1 = 11110111 so, -9 in 2's complement binary is 11110111 2) 1+1+1+1 = 4 Divide 4 successively by 2 until the quotient is 0 > 4/2 = 2, remainder is 0 > 2/2 = 1, remainder is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 100 So, 4 of decimal is 100 in binary Answer: 0100 3) This is negative. so, follow these steps to convert this into a 2's complement binary Step 1: Divide 1 successively by 2 until the quotient is 0 > 1/2 = 0, remainder is 1 Read remainders from the bottom to top as 1 So, 1 of decimal is 1 in binary Adding 7 zeros on left hand side of this number to make this of length 8 So, 1 in normal binary is 00000001 Step 2: flip all the bits. Flip all 0's to 1 and all 1's to 0. 00000001 is flipped to 11111110 Step 3:. Add 1 to above result 11111110 + 1 = 11111111 so, -1 in 2's complement binary is 11111111
`1) How is -9 (base 10) represented in 8-bit two's complement notation? a) 00001001 b)11110111 c)11110110...
6. Convert the following 8-bit two's complement notation into base ten numbers. (8 points) a. 00011110 b. 11110100
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...
CruzlD: @ucsc.odu Arithmetic and Logical Operations 19. Which of these 8-bit two's complement computations has carry out but no overflow? Select two answers: 1 1 011001 10 0 111 1 110 O A. averflas 1IIOOIOO O B. 1 0000000 has 11 1 1 111 1 co has c.o 1110i no dverfle + 0100 1101 1 1 01 011 O D. overluw + 0101 1 1 0 1 E 1 1 10 1 0 + 11 1 1 1000 20. Using...
5. Express (76) 10 and (-114)10 in 8-bit binary two's complement arithmetic and then add the numbers. What would be the representation (0)10 in 16-bit binary two's complement? (be sure to show your work). 6. Create two 16-bit 2's complement integer such that their sum causes an overflow. Why does the sum of a negative 2's complement number and a positive 2's complement number never generate an overflow? Discuss.
b. 8 bit Twos Complement (Ones complement and a 1 to result (show original = binary conversion = one’s complement = twos complement) Examples: -0 = -0000 0000 = 1111 1111 = 0000 0000 +0 = +0000 0000 = 0000 0000 = 0000 0000 -5 = +253 = -87 = -114 = 4. Convert the following Floating Point numbers to binary Example: 0.25 base 10 = 0.01 in base 2 0.50 base 10 = 0.125 base 10 = 0.75 base...
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....
24. What bit patterns are represented by the following hexadecimal notations? a. BD b. 76 25. Express the following bit patterns in hexadecimal notation: 101000001010 26. Convert each of the following binary representations to its equivalent base ten representation: a. 1101 b. 0101 c. 11001 d. 1000 27. Convert each of the following excess 16 representations to its equivaleht base ten representation: a. 10101 b. 10001 c. 01011 28. Convert each of the following base ten representations to its equivalent...
Do the following number conversions assuming two's complement representation is used for binary numbers. Douto check your answers becauses mentioned in class.portul credt will not be please digit is wrong in your answer. Do not put any space between ages/bits in your answers a. (113710 - 02 (8-bit binary number) b. (-97)10 - 12 (8-bit binary number) C. (0101 11002 D10 (decimal number) d. (1010 00112 010 (decimal number e. (3C7B)16 12 (16-bit binary number) f. (0100 1011 1000 1110)2-(...
HW3: Problem 1: (first, study the example-1 in page-6) A computer uses 8-bit for FLP (1 bit for sign, 4 bit for exponent with excess-7 rep. (see table below), rest for magnitude). Assume 0000 and 1111 in exponent field are reserved for denormalization. 6 Decimal 0 Unsigned 0000 Excess-7 Reserved used as -6 in unnormalized 1 0001 -6 2 0010 -5 3 0011 -4 4 0100 -3 5 0101 -2 0110 -1 7 0111 0 9 Decimal 8 Unsigned 1000...
Convert the following 8-bit twos-complement numbers to signed decimal numbers. (a) 00000001 (c) 1 9-6 (b) 10010000 (d) 10000000