3. For each of the following base 10 numbers below, (i) convert the number to binary (show your work) and (ii) find the double precision representation fl(x) by using the round-to- nearest rule (see Example 1.11 on page 22 in the notes, but here you do not need to find the relative error). Sadly, this mean that you need to give me all 52 bits to the right of the decimal point...sorry about that! a) 1/4 b) 1/3 c) 2/3 d) 0.9

3. For each of the following base 10 numbers below, (i) convert the number to binary (show your work) and (ii) find the double precision representation fl(x) by using the round-to- nearest rule (see Example 1.11 on page 22 in the notes, but here you do not need to find the relative error). Sadly, this mean that you need to give me all 52 bits to the right of the decimal point...sorry about that! a) 1/4 b) 1/3 c) 2/3 d) 0.9

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

The number -82 is represented as an integer with respect to the complement of 2 in 32 bits. According to this, a) If we rotate this number 8 bits to the left, what will be the result, show it in hexadecimal format? b) If we rotate this number 4 bits to the right, what will be the result, show it in hexadecimal format?
Write down the bit pattern assuming that we are using base 15 numbers in the fraction instead of base 2. (Base 16 numbers use the symbols 0–9 and A–F. Base 15 numbers would use 0–9 and A–E.) Assume there are 24 bits, and you do not need to normalize. Is this representation exact?
Answer the given question with a proper explanation and step-by-step solution. Find the doubleword-length 2's complement hex representation of the following decimal number: -934 Notes: When writing the hex value using this representation, you should always write pairs of digits with spaces between them. For example, if the value is 3F2E44DA2C, then it should be written as 3F 2E 44 DA 2C. Make sure your answer is the correct size. If it is not written in the correct size, it is wrong! Hexadecimal:
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.
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?
When providing a base-ten block representation for the number 3.59, James uses 2 flats, 13 Rods, and 29 cubes. Is this an acceptable representation, if it is not explain why, if it is tell me the unit that James is using.
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.
Write down the bit pattern in the fraction assuming a fl oating 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?
You need to show detail work on how you get the answer. Dont use answers from other websites please! Please type your answer not picture 2. a) What is "Approximation Error" in floating-point representation? b) Why is it happening? c) How can we minimize it? d) How can the character codes be a solution for this?
Please answer parts a, b, and c of this question. 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 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 the numbers so they are both expressed using the same power of 2. c) 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.
Suppose A = +54 and B = -3 (both in base 10).Q1: What is the lowest number of rounds theoretically to complete the integer division using the optimized division algorithm?Q2: What is the resulting number in binary representation if we use 8 bits to represent it?Q3: What is the resulting number in FP decimal representation if we use the IEEE 754 standard for single precision? (form of this result should be in sign, true exponent in binary, IEEE-754 Exponent in binary and IEEE-754 exponent in decimal (base 10 number) )
If an unsigned 8-bit integer were to be extended to a 16-bit one, the first 8 most significant bits (MSB) would be filled with ones, creating a signed 16-bit representation. Pick a solution from these two options: Is it true or false that...?