Write a C/C++ program to extract the sign bit, exponent field, and the fraction field of a 32-bit hexadecimal number (in the IEEE 754 standard) and then compute the corresponding floating- point in decimal using the formula (-1)sign ×(1+ fraction ×2-23)×2(exponent-127) (You can ignore special cases including 0). Print each field as unsigned hexadecimal (%X) and the decimal value in scientific notation ("%E"). Then apply for your program to the following four representations (single precision only) 19 ten. -7/6 ten. 0.3 ten. 63.50 ten.

Write a C/C++ program to extract the sign bit, exponent field, and the fraction field of a 32-bit hexadecimal number (in the IEEE 754 standard) and then compute the corresponding floating- point in decimal using the formula (-1)sign ×(1+ fraction ×2-23)×2(exponent-127) (You can ignore special cases including 0). Print each field as unsigned hexadecimal (%X) and the decimal value in scientific notation ("%E"). Then apply for your program to the following four representations (single precision only) 19 ten. -7/6 ten. 0.3 ten. 63.50 ten.

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

Write a C++ program to calculate Fubanaci numbers Xn, n=1,2,...,100 Xn+1 = Xn+ Xn-1, X0=1,, X1=1, n=1,2,...
Write a C program that prints the multiplication table for the number 8 (using while )
Write it in a Basic C Program Represent the binary representation of a float type to integer type. Single precision float (32-bit length) is represented in IEEE754 format: 1 bit of sign, 8 for exponent plus bias of 127, and 23 for the mantissa. Example: * 85.125 is [101 0101.001] in binary and this would be [1.0101 0100 1 x 2^6] in scientific notation of base 2. * Our sign bit will be [0] (positive), exponent+bias is [1000 0101] (6 + 127 = 133), and mantissa of [0 1010 1001000...] (whole is omitted and zeroes are added to the right until its length is 23). * Merging this will be [0100 0010 1010 1010 0100 0000 0000 0000] which is equivalent as 1118453760 in integer. * Therefore, binary of 85.125 in float is 1118453760 in integer. Input A single line containing a float type non-positive number. 85.125 Output A single line containing the integer representation of float type binary. 1118453760
write C++ programs to print the following:1- The integers from 100 down to 0 by fives; that is, the first three lines should be 100, 95, 90, 85...... 2- This figure 4097 0$ 4096 1$ 1024 2$ 256 3$ 256 3$ 1024 2$ 4096 1$ 4097 0$
Write a program in C and assembly to count the number of set bits (bits=1) in a 32 bit integer. Ask the user to enter the integer numbers and print the result in C.
Write a c++ program function that makes the base conversion. It takes two integers n and b as input (n >= 0 and b > 1, both in base 10) and expresses n in base b. For example, the decimal expansion of 345 in base 10 is 345=3×102 +4×101 +5×100.Sample input: n = 12, b = 2. Sample output: 1100 Explanation: (12)10 = (1100)2
Write a C++ program to print the Binary of all decimal numbers from 1 to N after taking input the value of N from the user.
write a c++ program to factor a polynomial of the form x² + bx + c, where b and c are integers. Modify the program so that it can also factor polynomials of the form ax2 + bx + c , where a, b, and c are integers. Note that the polynomial _ - 2x² - 3x + 2_ can be factored as: _ - 2x² - 3x + 2 = (-2x + 1)(x + 2) = - (2x - 1)(x + 2)_. Input: -2 -3 2 output: -2x^2 - 3x + 2 = -(2x - 1)(x + 2) Input: 2 3 -2 output: 2x^2 + 3x - 2 = (2x - 1)(x + 2)
Write in C++ program: Problem: Represent the binary representation of a float type to integer type. Single precision float (32-bit length) is represented in IEEE754 format: 1 bit of sign, 8 for exponent plus bias of 127, and 23 for the mantissa. Example: * 85.125 is [101 0101.001] in binary and this would be [1.0101 0100 1 x 2^6] in scientific notation of base 2. * Our sign bit will be [0] (positive), exponent+bias is [1000 0101] (6 + 127 = 133), and mantissa of [0 1010 1001000...] (whole is omitted and zeroes are added to the right until its length is 23). * Merging this will be [0100 0010 1010 1010 0100 0000 0000 0000] which is equivalent as 1118453760 in integer. * Therefore, binary of 85.125 in float is 1118453760 in integer. Input A single line containing a float type non-positive number. 85.125 Output A single line containing the integer representation of float type binary. 1118453760
1. Write a C++ program that utilizes looping to print the following table of values: N 10*N 100*N 1000*N 1 10 100 1000 2 20 200 2000 3 30 300 3000 4 40 400 4000 5 50 500 5000
Implement the function (in C or C++) with the following prototype: /** Implement a function which rotates a word left by n-bits, and returns that rotated value. Assume 0 <= n < w Examples: when x = 0x12345678 and w = 32: n=4 -> 0x23456781 n=20 -> 0x67812345 */ unsigned rotate_left(unsigned x, int n); The function should follow the bit-level integer coding rules above. Be careful of the case n = 0.
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.