Problem 2: Working with Digital Representation Given the following normalized 14-bit format with an excess-16 bias, answer the following questions: 1 1 0 0 1 1 1 1 0 0 0 100 11000 11000 1000 a- Find the equivalent decimal values of both numbers b- Add the above given numbers using floating-point arithmetic and show the result in a normalized 14-bit format with an excess-16 bias. c- Prove that your answer in part b is correct by checking its decimal equivalent value with the sum of the equivalent decimal values of both numbers you calculated in part a.

Problem 2: Working with Digital Representation Given the following normalized 14-bit format with an excess-16 bias, answer the following questions: 1 1 0 0 1 1 1 1 0 0 0 100 11000 11000 1000 a- Find the equivalent decimal values of both numbers b- Add the above given numbers using floating-point arithmetic and show the result in a normalized 14-bit format with an excess-16 bias. c- Prove that your answer in part b is correct by checking its decimal equivalent value with the sum of the equivalent decimal values of both numbers you calculated in part a.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Perform the following conversions. Assume that 8 bits are used. a. Convert the decimal -24 to binary. b. Convert the hexadecimal 4B to decimal. c. Add binary 00001011 to binary 00101111 and provide the result in binary. d. Convert the answer in part c to decimal.
Please give me correct solution.
H - For the IEEE 754 single-precision floating point, write the hexadecimal representation for the following decimal values: (i)–1.0 (ii)– 0.0 (iii)256.015625
7) The sum of 16216 + 4816 is A) 1AA16 B) 2AA16 C) 21016 D) 2BA16 8) What is the BCD form of 735 in even parity? A) 0101001101110 B) 1010100110111 C) 0111001101011 D) 0011100110101 9) Which of the following is not a standard digital code?
Using the Hamming code given in classfor 8 bit data words, determine whether there is an error, and if so, in which bit, for each of the following words fetched from memory: A.0010 0011 0010 B.0110 0011 1010
I want a clear solution and a clear line as well.
In this question, you are provided with two unsigned binary numbers, A and B. You are asked to evaluate (-A - B) as well as (-A+B) using the two's complement 12-bit number system. If the result is encoded in less than 12 bits (including the sign bit), you need to extend it to fill the entire 12 bits. Indicate if an overflow occurred or not. N.B.: You need to provide the entire 12-bit result, even if an overflow occurs. You MUST report the answer in 2's complement. Do NOT convert the number back from the 2's complement. Leave it in the 2's complement representation. When A = 10110011010 and B = 100111100, the value of (-A - B) = the value of (-A + B) = If an overflow occurred during evaluating this expression, type yes, if not type no If an overflow occurred during evaluating this expression, type yes, if not type no = ; and
Chapter 2: Practice Problems 1. Assume we are running code on a 8-bit machine using two's complement arithmetic for signed integers. A "short" integer is encoded using 4 bits. Fill in the empty boxes in the table below. The following definitions are used in the table: short sy = -3; int y = sy; int x = -17; unsigned ux = x Note: You need not fill in entries marked with "-" Only accepted format for binary representation (use 8-bits): 00000000, 11111111 Only accepted format for hexadecimal representation: 4D, EF, FF Expression Binary Zero ux y X >> 2 Tmax Tmax+Tmin Tmin - 1 Decimal 0 -3 00110010 Hexadecimal
(3) The IEEE 754 standard specifies a single-precision binary floating-point format (binary32) as having 1 bit for sign bit, 8 bits for exponent, and 23 bits for fractions (mantissa). Given the conversion formula as follows, value2 = (-1)'31 × (1. b22b21 . bo)2 × 2(b30b29 .b23)2-127 ... (a) encode -2.2510 ; (b) decode 0 1000 0001 011 0000 0000 0000 0000 00002
Problem 2: Convert each of the following numbers to the 32-bit floating point format defined in the IEEE 754 Standard. Your final answer should be in HEX. Also state whether or not the representation is exact. а) b) – 1346 c) 0.275 85
Problem 3: Perform the indicated subtraction with the following unsigned binary numbers by taking the 2's complement of the subtrahend. (a) 11010 - 10001 (b) 11110 - 1110 (c) 101001- 101 Hint: You need to make the no of bits in the two numbers equal by padding Os to the left of the subtrahend before taking its 2's complement.
part C D just convert to binary, don't bother with hex