Interestingly some numbers can be perfectly represented in Base 10, but not in Base 2. An example is one-tenth (in Base 10, this is 0.1; in Base 2 this is a repeating decimal. Suppose we set both f and g to one-tenth using the statements below. f = 0.1; g = 0.1; Answer the following questions. For each, mark the best answer. Which will be closer to the actual value of one-tenth? f g Which can hold higher values? f g Which takes more memory? f g When using real values I should always use type double, to be safe. True False

Interestingly some numbers can be perfectly represented in Base 10, but not in Base 2. An example is one-tenth (in Base 10, this is 0.1; in Base 2 this is a repeating decimal. Suppose we set both f and g to one-tenth using the statements below. f = 0.1; g = 0.1; Answer the following questions. For each, mark the best answer. Which will be closer to the actual value of one-tenth? f g Which can hold higher values? f g Which takes more memory? f g When using real values I should always use type double, to be safe. True False

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 7VE

See similar textbooks

Similar questions

Given three floating-point numbers x, y, and z, output x to the power of z, x to the power of (y to the power of z), the absolute value of y, and the square root of (xy to the power of z). Use Java language.
2. What is the smallest 32-bit floating point number f such that128 + f > 128 ?What is the smallest 32-bit floating point number g such that 1 +g > 1 ?What is the relationship between f and g?Write a short C++ or Python program to support your answer.
1. Convert 1.375 and 0.75 to the 14-bit floating-point format of the textbook and add them up in that format, then convert your 14-bit result back to decimal and verify your computation. 2. Q2. What is the smallest 32-bit floating-point number f such that 128 + f > 128? What is the smallest 32-bit floating-point number g such that 1 + g > 1? What is the relationship between f and g? Write a short C++ or Python program to support your answer (for example, show that you checked whether there is no smaller number than your f by trying 128+f/2 == 128. 3.Explain what changes are needed to change the 4x3 memory presented on Slide 62 of Chapter 3 to a 16x6 memory.
Write a program using JAVA that converts a floating point number to the simple model of the floating point representation. The simple model uses 1 bit for sign, 5 bits for exponents and 8 bits for significand OPTIONAL: You decide to use bias of 15 or not. Either way is ok.
To convert the value 30 in decimal notation to an 8-bit binary integer, you may use any one of the following representation methods: a) the complement of one's opposite; b) the opposite of excess; or?
Given three floating-point numbers x, y, and z, output x to the power of z, x to the power of (y to the power of z), the absolute value of (x minus y), and the square root of (x to the power of z). Output each floating-point value with two digits after the decimal point, which can be achieved as follows: print(f'{your_value1:.2f} {your_value2:.2f} {your_value3:.2f} {your_value4:.2f}') Ex: If the input is: 5.0 1.5 3.2 Then the output is: 172.47 361.66 3.50 13.13
Assume our floating-point format is (decimal) X.XX * 10Y. Show the steps involved in floating point addition by using 6.11*101 + 5.76*103 as an example.
Write short notes on the following and give at least four examples each x. Machine Numbersxi. Floating-point representationxii. Arithmetic Operations
When Python 3 stores x=2.75x as a floating point number, what is the value of the exponent e? When Python 3 stores x=2.75 as a floating point number, what is the value of the mantissa m?
I just posted the question and got an answer, but it was not an understandable answer.What I want is the explanatory results of the binary floating point representation and the rounded value parts.help me please
In C++, How many positive values could an unsigned int hold on a computer where an integer is made up of 4 bits.
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…