this is computer organization

5) Find the two's complement binary number representation of 42 (decimal) using 8-bit numbers. 6) Find the two's complement binary number representation of -42 (decimal) using 8-bit numbers. 7) Consider this two's complement binary number: 10011110. What is its decimal value? 8) Find the 8-bit two's complement binary number representation of 137 (decimal). Briefly describe what went wrong, and what that implies about the limits of this representation scheme? 9) What is the 32-bit IEEE 754 floating point representation for 3.5? 10) If (42510000)16 is the 32-bit IEEE 754 representation of a floating-point number, what is the floating point number? 11) Show the IEEE 754 binary representation for the following floating-point numbers a. 356.75 b. -11.5 12) Convert the following numbers represented in IEEE 754 floating point representation to their equivalent decimal numbers. a. 0111 1111 1 000 0100 0100 1111 0000 0000 b. 0 101 11001 010 0100 0100 0000 0000 0000 C. 1000 1101 1011 0110 1000 0000 0000 0000 d. 1 000 0000 0 011 1011 0000 0000 0000 0000 13) The floating-point representations of X and Y are given below. Perform X+Y. X = 1011 10111 100 1000 0000 0000 0000 0000 Y = 0 100 0100 1 001 0100 1000 0000 0000 0000 14) Represent the following numbers using 8-bit 2's complement representation a. - 4710 b. -1239 C. 5016 15) Perform the following arithmetic operations on the two's complement numbers given below. Indicate whether an overflow occurs or not. The first bit in each number is a sign bit. a. 10110 + 11001 b. 11001 + 11000 16) Convert the following 2's complement binary numbers to decimal. a. 0110 b. 1101 C. 0110 1111 d. 1101 1011 0001 1100 17) The following binary numbers are 4-bit 2's complement binary numbers. Which of the following operations generate overflow? Justify your answers by translating the operands and results into decimal. a. 0011 +1100 b. 0111 + 1111 C. 1110 + 1000 d. 0110 + 0010 18) Write the parity bit (both even and odd) for the following binary numbers: a. 1100 b. 1000 C. 0000 d. 1101 19) Floating-Point Addition: add the following binary numbers a. 1.000 * 2.1 + 1.110 * 2:2 b. 1.000* 21 +-1.110 * 22 or, 1.000 * 21 + (-1.110 + 2?) C. 1.010 * 2-2 + 1.110 * 23 20) Floating-Point Addition: add the following numbers (converting into binaries) a. 5.7510 +2.2510 b. 3.510 +0.2510 21) Consider the following numbers as 4-bit signed binary number. Indicate whether the result wil generate any overflow, or not? a. 1111 + 1000 b. 1100 +0100 C. 0100 +0011 d. 0001 +0111 22) Consider the following numbers. Indicate whether the addition operation will generate any overflow. Show the results, considering the numbers as (1) signed and (ii) unsigned a. 1210 + 810 (Represent the numbers in 5-bit binary) b. A16 + 2416 (Represent the numbers in 6-bit binary) 23) Convert the following numbers to gray code: a. 010012 b. 4310 C. 3A16 d. 111112 e. 558 f. 1010012 R.1101012 24) Convert the following numbers represented in gray code to the bases shown a. 1001 to binary b. 10011 to hexadecimal C. 10001 to octal d. 11111 to decimal