2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x 1011
3. Perform the following binary divisions, assuming unsigned integers: B. 10000001 / 101 C. 1001010010 / 1011
4. Assume we are using the simple model for floating-point representation as given in the text (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 16, a normalized mantissa of 8 bits, and single sign bit for the number ):
Show how the computer would represent the numbers 100.0 and 0.25 using this flouting-point format. Show how the computer would add the two floating-point numbers in part a by changing one of the one of the numbers so they both expressed using the same power of 2.
Show how the computer would represent the sum in part b using the given floating-point representation. What decimal value for the sum is the computer actually storing? Explain
5. A. Given that ASCII code for A is 1000001, what is ASCII for J? B. Given that the EBCDIC code for A is 1100 0001, what is the EBCDIC code for J? 6. Using the CRC polynomial 1101, compute the CRC code word for the information word, 01001101. Check the division performed at the receiver
In binary multiplication, we only need to remember the following,
0 x 0 = 0
0 x 1 = 0
1 x 0 = 0
1 x 1 = 1
2) B) 10011 x 011
10011
x 011
--------------------
10011
100110 <---- 0 is the placeholder here
0000000
---------------
111001 <---- Sum of the above 3
----------------
2) C) 11010 x 1011
11010
x 1011
-------------------
11010
110100
0000000
11010000
----------------
100011110
2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...
1. Assume we are using the simple model for floating-point representation as given in this book (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 15, a normalized mantissa of 8 bits, and a single sign bit for the number): a) Show how the computer would represent the numbers 100.0 and 0.25 using this floating-point format. b) Show how the computer would add the two floating-point numbers in part a by changing one of...
(ii) The following two numbers are represented in unsigned binary: A = (10001)2 B=(100102 Represent these two numbers in signed l's complement form and perform the following binary arithmetic operations using the l's complement method. Use the necessary number of bits to represent both numbers and results including the sign bit. C= A +B; D=A-B.
Given the interpretation and the word(s), tell what characters or decimal numbers are stored in main memory by the designated word(s). We assume our computer uses 8 bits for characters and 16 bits for binary integers: (show your work) Word I 1011 0010 0010 0000 Word II 0100 1001 0101 0010 1) Binary Integer - Word I 2) Character (ASCII) – Word II _____________________________________________________________________________________________________________________________________________________ For the following problems, assume that our computer uses 16 bits for binary integers. Find the...
4. What decimal value does the 8-bit binary number 10011110 have if: a) It is interpreted as an unsigned number? b) It is on a computer using signed-magnitude representation? c) It is on a computer using ones complement representation? d) It is on a computer using twos complement representation? 5. Given the following two binary numbers: 11111100 and 01110000. a) Which of these two numbers is the larger unsigned binary number? b) Which of these two is the larger when it is being...
ints) The following questions pertain to machine numbers (a) (2 points) For an 8-bit unsigned integer, what is the decimal equivalent of 10010101? (b) (3 points) For an S-bit signed integer, what is the decimal equivalent for the 2's compliment of 11010101? (c) (5 points) Consider an 8-bit floating point number like the one in Homework A2 (one sign bit, three exponent bits, and four assignable mantissa bits), what is the floating point number that associates with 01101 1001? ints)...
Given the following 16 bit numbers: A.) 0x8FFF B.) 0x1000 C.) Ox00FO D.) 0x0888 E.) 0xC000 F) 0x9000 . If the numbers are unsigned integers rank them from smallest to larest )rank them from smallest to largest 10. If the above number are signed integers (2's complement 11Acomputer has a 16 bit address field,is byte addressable, the word length is also 16 bits, 32 lines of direct mapped cache and each line of cache holds 8 bytes. A.) How many...
PLEASE NOTE: PLEASE ANSWER IN MATHEMATICAL FORM!! THIS IS NOT ESSAY QUESTION. THANKS Question 5 The shortest IEEE standard for rep- expnt fraction resenting rational numbers is called half-precision float- sign (S bit) ing point. It uses a 16-bit word partitioned as in the I diagram at right. (This diagram is taken from the Wiki can be found.) (10 bit) article on the subject, where more details 15 10 As described in lectures, to store a rational number r it...
Q1) Convert the following negative decimal numbers to 8 bit binary using the 2’s complement (show the steps): a) -39 b) -127 Q2) Solve the following subtraction problems using 2's complement representation. (Show the steps using 8-bits) a) 19 – 87 b) 89 – 5 Q3) Convert the following numbers into scientific notation: (Note: to show ten raised to the power of n, you can type as 10^n) a) 654.345 b) 0.000000324235 c) 25600000000000 Q4) Convert the following numbers out...
6. Convert .3710 to a binary fraction of 10 binary digits. 7. Use two's compliment arithmetic to perform the following 8 bit binary operations. a. 0010 1110 + 0001 1011 b. 0101 1101 – 0011 1010 c. 1011 1000 – 1000 1011 d. 1000 1100 – 1111 0111 8. Convert 150.8476562510 to IEEE Floating Point Standard. 9. Simplify the following Boolean expressions. a. xy + xy + xz b. (w + x)(x + y)(w + x + y + z)...
26. The is a group of bits that tells the computer to perform a specific operation A). program counter B). Opcode C). register D). microoperation 27. A condition called occurs in unsigned binary representation of a number when the result of an arithmetic operation is outside the range of allowable precision for the given number of bits. A). underflow B). 2's complement C). overflow D) bitwise complement 28. An iteration of the fetch-decode-execute cycle includes which of the following events?...