Show yor step by step solution of conversion Dont use answers from other websites please! Please type your answer not picture 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.

Show yor step by step solution of conversion Dont use answers from other websites please! Please type your answer not picture 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.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 3RQ

See similar textbooks

Similar questions

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?
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.
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).
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?
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
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...?
What does the Huffman code for a series of only two-character symbols look like? Give an example of a series of N characters with all of the characters coming from a two-character script to demonstrate the highest number of bits that could be used in a Huffman code.
Given a single-precision IEEE 754 representation of a floating point number as: 0x40700000, do the following: (a) Express the value of the S field in binary without spaces (count carefully). Do not abbreviate your answer. (b) Express the value of the E field in binary without spaces (count carefully). Do not abbreviate your answer. (c) Express the value of the F field in binary without spaces (count carefully). Do not abbreviate your answer.
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:
Solve all parts or i will dislike A) 1.0 x 2^127 is the largest absolute number that can be represented in the 32-bit representation (True/False) For True enter 1 For False enter 0 ? B) 1.0 x 2^200 will be considered as Infinity in the 32-point representation (True/False) ?
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)