In this question, we consider a non-standard floating point number representation, which is based on IEEE-754 but has different order and lengths of fields as shown below: Mantissa (15 bits) Sign (1 bit) Exponent (16 bits) Assume that the bias is still calculated based on the formula: 2exponent 1. Convert the following decimal numbers into the above non-standard representation form. Please write down all intermediate steps of the calculations of mantissa and exponent.

In this question, we consider a non-standard floating point number representation, which is based on IEEE-754 but has different order and lengths of fields as shown below: Mantissa (15 bits) Sign (1 bit) Exponent (16 bits) Assume that the bias is still calculated based on the formula: 2exponent 1. Convert the following decimal numbers into the above non-standard representation form. Please write down all intermediate steps of the calculations of mantissa and exponent.

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

Consider an 8-bit floating point format. In this representation 4 bits are reserved for the mantissa and 3 bits are reserved for the exponent and 1 bit is reserved for the sign of the number. The exponent of the number is stored with a bias = 3. Express the decimal number 4.75 in this 8 bit floating point format. Write down the next bigger representable number in decimal base. B If you would be conducting the following operation using this 8 bit floating point format what would the result of the following calculation be ? 4.75 + 0.05 - 4.75 Express the decimal number 4.75 in this 8 bit floating point format. [10] b) Write down the next bigger representable number in decimal base. [7.5] c) If you would be conducting the following operation using this 8 bit floating point format what would the result of the following calculation be ? 4.75 + 0.05 - 4.75
Consider a 6-bit two’s complement representation. Fill in the box with question mark "?" in the following table. You don't need to care about "n/a." Number Binary Representation TMin + TMin ? Please input the binary representation in this format xxxxxx. For example, if the answer is 010010, please input 010010.
1) Find the equivalent decimal value of the following floating-point representation using IEEE 754 standard single-precision (32-bit floating-point number with bias = 127) 1 0111 1111 1110 0000 0000 0000 0000 000 (The quiz is expecting a decimal numeric entry. It will automatically suppress leading and trailing zeros. It will display your answer with commas every third digit.) 2) Find an IEEE 754 floating-point representation of -74.2 decimal number. Enter 32 bits without a space. (The quiz is expecting a fill in the blank text string in the entry box and grades on an exact match with the expected result. The answer should be formatted as a 32-bit IEEE 745 binary number representation)
6. Convert the following numbers from unsigned binary notation to decimal notation, and from 6-bit 2's complement notation to decimal notation: i) 110011, ii) 001101, iii) 101101 7. Show how each of the following floating point values would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand fields): a. 12.5 b. −1.5 c. 0.75 d. 26.625 8. The following is a representation of a decimal floating value using IEEE-754 single precision. Find out the value in decimal. 0 10000011 10101000000...0
What are the differences between 64-bit and 128-bit floating-point representations? "Let's look at one example."
Show Steps Please 20. Suppose we have just found yet another representation for floating point numbers. Using thisrepresentation, a 12-bit floating point number has 1 bit for the sign of the number, 4 bits forthe exponent and 7 bits for the mantissa, which is normalized as in the Simple Model so thatthe first digit to the right of the radix points must be a 1. Numbers in the exponent are in signed2's complement representation. No bias is used and there are no implied bits. Show therepresentation for the smallest positive number this machine can represent using the followingformat (simply fill in the squares provided). What decimal number does this equate to?
Suppose A = -14 and B = +6 (both in base 10) C=A*B What is the resulting product of your previous multiplication in FP decimal representation (simply use a decimal point)? Take the result you just produce and shift it by three digits to the right of the decimal point (e.g., if your number was 12.0 it now becomes 0.012). Now, express your shifted result as a single precision FP number using the IEEE 754 standard for single precision (of course you need to convert the number from decimal to binary). Please do not calculate more than the first 8 fraction bits.
Write down the bit pattern in the fraction of value1/3 assuming a floating point format that uses Binary Coded Decimal (base 10) numbers in the fraction instead of base 2. Assume there are 24 bits, and you do not need to normalize. Is this representation exact?
Consider the following floating point representation where each number has 2exponent bits and 5 fraction bits. The exponent bias is 1. Round each number tohave 3 fraction bits. Apply round-to-even and round-toward-zero modes.a. 1 10 11100b. 0 00 00101c. 1 01 10101i. Can you see a pattern for rounding floating point numbers when thenumber of exponent bits are intact?
Consider a hypothetical 8 bit floating point machine representation with a sign bit, a 3 bit exponent, and a 4 bit mantissa (se1e2e3b1b2b3b4), where the exponent bias is 3 (add 3 to exponent of number to form machine representation). Recall that actual mantissa has 5 bits, since the leading 1 is not stored on the machine. (a) What is the number ?≈2.718 in this 8-bit format? (b) What is the number that (10100111)2 represents in this 8-bit format? (c) What is the upper bound of the relative error when representing a real number in this 8-bit format?
Please help me solve this problem with kind explanations :) We are running programs on a machine where values of type int have a 32-bit two's complement representation. Values of type float use the 32-bit IEEE format, and values of type double use the 64-bit IEEE format. We generate arbitrary integer values x, y, and z, and convert them to values of type double as follow: /* Create some arbitrary values */ int x = random(); int y = random(); int z = random(); /* Convert to double */ double dx = (double) x; double dy = (double) y; double dz = (double) z; For each of the following C expressions, you are to indicate whether or not the expression always yields 1. If it always yields 1, describe the underlying mathematical principles. Otherwise, give an example of arguments that make it yield 0. Note that you cannot use an IA32 machine running GCC to test your answers, since it would use the 80-bit extended-precision representation for both float and double. A. (double)(float) x == dx B. dx…
Explain the term masking. How is it useful for data representation? Explain the concept using an example For a floating-point format with a k -bit exponent and an n -bit fraction, give a formula for the smallest positive integer that cannot be represented exactly (because it would require an n + 1 –bit fraction to be exact).