Question 1 The binary byte-length 2’s complement representation of the decimal number   -25 Group of answer choices 11100011 11100111 1111111111100111 none of them        Question 2   The Binary Representation for each of the following Hexadecimal number 5C Group of answer choices 01011100 10011000 10111100 none of them       Question 3 Question 34 pts The binary word-length 2’s complement representation of the decimal number   -100 Group of answer choices 1111111110011100 1111111100011100 1111111110011000 none of them

Perform the following additions and subtractions. Assume the numbers are stored in signed-magnitude base 2 representation 1. -1010111 + -10011 Please show the process with details

Represent the following decimal numbers in binary using 8-bit signed magnitude, one's complement, two's complement, and excess-127 representations: +++ Decimal +38 -54 SM 00101010 11110101 OC 01000100 11110101 TC 00001111 11110101 Excess-127 10001111 11110101

How many bits long is a double-precision number under the IEEE-754 floating-point standard?

What is the Gray code's unique feature in regard to nearby decimal digits?

What decimal value does the 8-bit binary number 10100110 have if it is represented using two's complement representation?

Represent the decimal number -66 in binary using 8-bit excess-127 representations 0 01111101 00111100 00111101 O 00111111

2. Convert each of the following binary numbers to its 2s-Complement Signed Binary representation: Binary 0000 0110 0010 1100 0000 1110 0011 0110 0000 0001 1011 1110 2s-Complement

What is the decimal value of the following number (which is in single-precision IEEE floating point format?) Show your work and explain what each part of the representation is and how you achieve your final answer. 00111111010000000000000000000000

For the three code words:C1= [110110011], C2= [100101100]andC3=[111100101]. Determine the possible error detection and the possible error .correction