Assume we are using the simple model for floating-point representation as given in this book (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). What decimal value (no leading/trailing zeros) for the sum of 01011011001000 and 00111010000000 is the computer actually storing?

Assume we are using the simple model for floating-point representation as given in this book (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). What decimal value (no leading/trailing zeros) for the sum of 01011011001000 and 00111010000000 is the computer actually storing?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 4PE

See similar textbooks

Similar questions

A(n) __________ is an integer stored in double the normal number of bit positions.
Assume we are using the simple model for floating-point representation discussed in the class (the representation uses a 14-bit format, 5 bits for the exponent with an Excess-M, a significand of 8 bits, and a single sign bit for the number): Convert -43.0735 to the floating-point binary representation. (Remember we learned "implied one" format in the lecture)
For 10 bits floating point representation using: seeeefffff, what is the bias for denormalized numbers? A. 7 B. 6 C. 4 D. 3 E. 2 What is the range of integers that can be represented using 8 bits 2's complement? A. -127 to 127 B. -128 to 127 C. -127 to 128 D. 0 to 255 E. 0 to 256
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?
Given a floating point representation 10110 11101101000 (5-bit exponent and 11-bit significant) 3. if the exponent is in signed magnitude and the significant is in two’s, what are its normalized floating point representation in hexadecimal and its real value in hexadecimal?
1. Write down the mathematical notation for fixed point representationand floating representation and also explain each term. 2. Consider the following machine number in 64 bit and Precisely represent the above machine number in decimal digits. 0 10000000011 1011100100010000000000000000000000000000000000000000
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).
Assume we have a byte system for the fixed number representation (the whole number is presented with 8-bits (one byte) and the fractional part is presented with 2-bits), find the 2's complement of 0110 0010.01 The answer should be formatted as a fractional 2's complement binary number representation with the exact format of the answer that is required of this particular calculation. I've gotten an answer of 1001 1110.00 but it says its wrong please help
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...?
Why do we use binary encodings to represent information in the computer? What would be the pros and cons of using base-10 instead of base-2? Explain the relationship between Boolean logic and computer circuits. Why is Boolean logic so important to computer science?
Given a 10-bit floating-point number with a 4-bit exponent field which follows IEEE floating point rules except for the above sizes: What is the hexadecimal representation of the bit-pattern representing minus infinity? Give the hexadecimal representation of the bit-pattern and the decimal value of the smallest positive number. Give the hexadecimal representation of the bit-pattern and the decimal value of the smallest positive normalized number. Give the hexadecimal representation of the bit-pattern and the decimal value for the most negative number which is not minus infinity. Give the smallest and largest ULP values possible in this representation. You should use a calculator to solve this problem.
1. Assume we are using the simple model for floating-point representation discussed in the class (the representation uses a 14-bit format, 5 bits for the exponent with an Excess-M, a significand of 8 bits, and a single sign bit for the number) Convert -123.075 to the floating-point binary representation. 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?