We are using the simple model for floating point representation which is 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. Show step by step how the computer would represent the following numbers using this floating- point format | a. -6.47510 i. Convert it into a binary number ii. Normalize this binary number iii. Fill up the fields

We are using the simple model for floating point representation which is 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. Show step by step how the computer would represent the following numbers using this floating- point format | a. -6.47510 i. Convert it into a binary number ii. Normalize this binary number iii. Fill up the fields

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

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.
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...?
Assume we are using the simple model for floating-pointrepresentation as given in the text (the representation uses a 14-bitformat, 5 bits for the exponent with a bias of 15, a normalizedmantissa of 8 bits, and a single sign bit for the number):1. a) Show how the computer would represent the numbers100.0 and 0.25 using this floating-point format.2. b) Show how the computer would add the two floating-pointnumbers in Part a by changing one of the numbers so theyare both expressed using the same power of 2. c) Show how the computer would represent the sum in Partb using the given floating-point representation. Whatdecimal value for the sum is the computer actually storing?Explain.
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?
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?
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.
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?
What is the decimal value of the following number (which is in single-precision IEEE floating point format?) Show your work and explain what each part of the representation is and how you achieve your final answer. 00111111010000000000000000000000
This problem covers floating-point IEEE format.(a) Assuming single precision IEEE 754 format, what is the binary pattern for decimal number 6.16?(b) Assuming single precision IEEE 754 format, what decimal number is represented by this word:0 01111110 01100000000000000000000
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
In a Digital Logic examination, you are given two signed integers in different number systems. A= (64)16 B= -(103)8Determine their values in the decimal system AN, b) Find the value of n, the shortest word-length of a computer using two’s complement representation which can represent all these numbers. Find the largest and thesmallest numbers that can be represented. c) Give the n-bit two’s complement representations of the two numbers, where n isvalue determined in b.