Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assu...

Question

Question

$Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assuming a floating point format$

engineering Electrical-Engineering

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

st bit is sign , next 8 bs ts and next 15 bits are manlisa are eXponen ence 0. 333 is dlecimol vale o. 666 X 2 - 332 0.332×2

Converl todeimal numbe ② 1.st6tep 3 O. 333-0, 25-0. o83 -14 2 150. 0625 (we Keep o eXponen) t bits- mantissa 1 bit - sign O o

Add a comment

Answer 2

Similar Homework Help Questions

Assume a 10-bit floating point representation format where the Exponent Field has 4 bits

Assume a 10-bit floating point representation format where the Exponent Field has 4 bits and the Fraction Field has 6 bits and the sign bit field uses 1 bit S Exponent Field: 4 bits Fraction Fleld: 5 bits a) What is the representation of -8.80158 × 10-2 in this Format - assume bias =2M-1-1=24-1-1=7 (where N= number of exponent field bits) for normalized representation 1 -bias =-6 : for denormalized representationb) What is the range of representation for...
4. (5 points) IEEE 754-2008 contains a half precision that is only 16 bits wide. The leftmost bit...

4. (5 points) IEEE 754-2008 contains a half precision that is only 16 bits wide. The leftmost bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent-1.09375 x 10-1 assuming a version of this format, which uses an excess-16 format to store the exponent. Comment on how the range and accuracy of this...
Problem 4 (10 points): 1. Consider the numbers 23.724 and 0.3344770219. Please normalize both 2. ...

please help Problem 4 (10 points): 1. Consider the numbers 23.724 and 0.3344770219. Please normalize both 2. Calculate their sum by hand. 3. Convert to binary assuming each number is stored in a 16-bit register. Half-precision binary floating-point has: sign bit: lbit, exponent width: 5bits and a bias of 15, and significand 10 bits (16 bits total) 4. Show cach step of their binary addition, assuming you have one guard, one round, and one sticky bit, rounding to the nearest...

Consider a 9-bit floating-point representation based on the IEEE floating-point format, with one sign bit, four...

Consider a 9-bit floating-point representation based on the IEEE floating-point format, with one sign bit, four exponent bits (k = 4), and four fraction bits (n = 4). The exponent bias is 24-1-1-7. The table that follows enumerates some of the values for this 9-bit floating-point representation. Fill in the blank table entries using the following directions: e : The value represented by considering the exponent field to be an unsigned integer (as a decimal value) E: The value of...
1. Compute the decimal value for the following bit pattern, assuming it is a single-precision floating...

1. Compute the decimal value for the following bit pattern, assuming it is a single-precision floating point number (show major steps): 1100 0011 0001 0010 0100 1001 0010 0100 2. Convert the decimal -2118.75 into single-precision floating point number (show major steps). 3. Assume -75 and -122 are signed decimal integers stored in 8-bit sign-magnitude binary format. Calculate -75 + -122. Is there overflow, underflow, or neither?
Can you write process of the question? A fictional floating-point encoding scheme uses 1 bit for...

Can you write process of the question? A fictional floating-point encoding scheme uses 1 bit for sign followed by 1 bit for the exponent and 2 bits for the mantissa. It otherwise behaves exactly like the IEEE 754 encoding scheme. List down all decimal values that can be represented by this scheme along with their binary representation.

2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...

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 ):...
Question 5 The shortest IEEE standard for rep- expnt fraction resenting rational numbers is calle...

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...
(3 pts) Consider an unsigned fixed point decimal (Base10) representation with 8 digits, 5 to the...

(3 pts) Consider an unsigned fixed point decimal (Base10) representation with 8 digits, 5 to the left of the decimal point and 3 to the right. a.      What is the range of the expressible numbers? b.      What is the precision? c.       What is the error? ______________________________________________________________________________ (3 pts) Convert this unsigned base 2 number, 1001 10112, to each base given below (Note: the space in the binary string is purely for visual convenience) Show your work. Using...

Question 1: Write down an function named bitwisedFloatCompare(float number1, float number2) that tests whether a floating...

Question 1: Write down an function named bitwisedFloatCompare(float number1, float number2) that tests whether a floating point number number1 is less than, equal to or greater than another floating point number number2, by simply comparing their floating point representations bitwise from left to right, stopping as soon as the first differing bit is encountered. The fact that this can be done easily is the main motivation for biased exponent notation. The function should return 1 if number1 > number2, return...

Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assu...

Homework Answers

Add Answer to:
Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assu...

Post as a guest

Earn Coins

Assume a 10-bit floating point representation format where the Exponent Field has 4 bits

4. (5 points) IEEE 754-2008 contains a half precision that is only 16 bits wide. The leftmost bit...

Problem 4 (10 points): 1. Consider the numbers 23.724 and 0.3344770219. Please normalize both 2. ...

Consider a 9-bit floating-point representation based on the IEEE floating-point format, with one sign bit, four...

1. Compute the decimal value for the following bit pattern, assuming it is a single-precision floating...

Can you write process of the question? A fictional floating-point encoding scheme uses 1 bit for...

2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...

Question 5 The shortest IEEE standard for rep- expnt fraction resenting rational numbers is calle...

(3 pts) Consider an unsigned fixed point decimal (Base10) representation with 8 digits, 5 to the...

Question 1: Write down an function named bitwisedFloatCompare(float number1, float number2) that tests whether a floating...

Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assu...

Homework Answers

Add Answer to: Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assu...

Post as a guest

Earn Coins

Add Answer to:
Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assu...