(b) Convert the following hexadecimal numbers to binary: (i) 111111 (ii) 101 (c) How many bits are needed to represent the order of an entire deck of playing cards? 4. Express the following number as 32-Bit single precision floating point numbers; using 1 signed bit, 8 biased exponent bits (+127), 23 bits for magnitude with the MSB dropped. (a) The speed of light, c, 0.2998 x 10^9 5. Explain the functionality of the following VHDL program. entity BCDInv is port (B,C,A: in bit; X: out bit); end entity BCDInv architecture Invalid of BCDInv begin X <= (B or C) and A; end architecture Invalid;

(b) Convert the following hexadecimal numbers to binary: (i) 111111 (ii) 101 (c) How many bits are needed to represent the order of an entire deck of playing cards? 4. Express the following number as 32-Bit single precision floating point numbers; using 1 signed bit, 8 biased exponent bits (+127), 23 bits for magnitude with the MSB dropped. (a) The speed of light, c, 0.2998 x 10^9 5. Explain the functionality of the following VHDL program. entity BCDInv is port (B,C,A: in bit; X: out bit); end entity BCDInv architecture Invalid of BCDInv begin X <= (B or C) and A; end architecture Invalid;

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

Let's Assume, X=224A0000 and Y=336B0000 are two Hex numbers. Using IEEE-754 floating point arithmetic perform the below calculations and give the answers in decimal: Y What is the Bias exponent of X? What is actual exponent of X? What is the Bias exponent of Y? What is actual exponent of y? Now, what would be the value of X+Y in decimal? Consider two decimal points of the final results after rounding-up. A sample answer: 4.23*10^3When you are typing the '*' symbol in the input field, it will appear as a '·' symbol.
32) Let a = 1.0 × 29, b = − 1.0 × 29 and c = 1.0 × 21. Using the floating-point model described 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), perform the following calculations, paying close attention to the order of operations. What can you say about the algebraic properties of floating-point arithmetic in our finite model? Do you think this algebraic anomaly holds under multiplication as well as addition? b + (a + c) = (b + a) + c = Show Steps Please
Formulate a weighted binary code for the decimal digits ,using the following weight; (a) 6,3,1,1 (b) 6,4,2,1
Answer the given question with a proper explanation and step-by-step solution. Convert the following numbers into binary numbers and preform the operations. Show all your working details? a) 10710 + (- 210) b) 13310 - 9010 c) 1110 x 510
Assume 185 and 122 are signed 8-bit decimal integers stored in sign-magnitude format. Calculate 185 - 122. Is there overflow, underflow, or neither?
Calculate (3.41796875 *10-3 * 6.34765625 *10-3) by hand, assuming each of the values arestored in the 16-bit half precision format described in in the textbook. Assume 1 guard, 1 roundbit, and 1 sticky bit, and round to the nearest even. Show all the steps, and write your answer inthe 16-bit floating point format.
4, in the fixed-point machine, the following statement is wrong ( ).A. In addition to the complement, the original code and the inverted code cannot indicate that the original code of −1 B. +0 is not equal to −0C. the inverse of +0 is not equal to the negative of −0 D. For the same machine word length, the complement code can represent a negative number more than the original code and the inverted code.
Formulate a weighted binary code for the decimal digits, using the following weights: 6, 3, 1, 1
a. Assume (F43)(16) and (1B7)(16) are unsigned 12-bit Hexadecimal integers.CalculateF43 -1B7. Is there overflow?b. Assume 185 and 122 are unsigned 8-bit decimal integers. Calculate185 - 122. Is there overflow?c. Calculate (1100 1101)2 + (1100 10101)2
Calculate (4.41762275 *10-3 + 6.34225625 *10-3) * 1.05225 * 102 by hand, assuming each of the values are stored in the 16-bit half precision format described in in the textbook. Assume 1 guard, 1 round bit, and 1 sticky bit, and round to the nearest even. Show all the steps, and write your answer in both the 16-bit floating point format and in decimal.
1. two digits 8 & 3, Convert it to a 7-bit binary number (83 → 0010111) 3. Do the analysis of state-tape contents as in diagram (*) in ex.1 for a task of generating parity bit for the number. For the example, initial tape contents should be ΦΦ0010111Φ, and the parity bit is then 0 → final contents on the tape is Φ00010111Φ
Show Steps Please 21. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a) How many parity bits are necessary? b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001100110. 22. Using the CRC polynomial 1101, compute the CRC code word for the information word, 01001101. Check the division performed at the receiver.