Which of the following addition problems cannot be solved accurately when using a floating-point system in which each value is encoded by a byte whose most significant bit is the sign bit, the next three bits represent the exponent field in excess notation, and the last four bits represent the mantissa? A. 21/2+1 3/8 B. 3 1/2+4 1/2 C.7+3/4 A only A and B B only

Which of the following addition problems cannot be solved accurately when using a floating-point system in which each value is encoded by a byte whose most significant bit is the sign bit, the next three bits represent the exponent field in excess notation, and the last four bits represent the mantissa? A. 21/2+1 3/8 B. 3 1/2+4 1/2 C.7+3/4 A only A and B B only

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

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.
Question 23 options: Using the rules of the simple floating point model (1-bit sign, 5-bit biased exponent, 8-bit significand, and normalized such that the leftmost bit of the significand is always 1), the number 8.4375 (decimal) can be expressed as: (Do not use spaces or any English text. Provide only 14 bits.)
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
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.
a) Consider the (7,4) hamming code with data word 1111 and evaluate the 7-bt composite code word (use even parity). b) Assume the stored composite code from memory is 1010001. Evaluate the parity bits of the stored code, find the bit position in error, and correct it if it is correctable (use even parity).
It is necessary to formulate the Hamming code for four data bits, D3, D5, D6, and D7, together with three parity bits, P1, P2, and P4.1. Evaluate the 7-bit composite code word for the data word 0010.2. Evaluate three check bits, C4, C2, and C1, assuming no error.3. Assume an error in bit D5 during writing into memory. Show how the error in the bit is detected and corrected.4. Add parity bit P8 to include double-error detection in the code. Assume that errors occurred in bits P2 and D5. Show how the double error is detected.
3. A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data. Propose your own Roll as data bits (e.g roll 1 to 100) and show how the sender adds the parity bits and write the final code word that will be sent. Value of Key is 1011 (derived from polynomial function). Also show in the receiver side that the correct data is received.
Show Steps Please 21. Suppose we want an error-correcting code that will allow all single-bit errors to be correctedfor 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 ourerror-correcting code, find the code word to represent the 10-bit information word:1001100110.
Problem 5.In the bit model estimate the number of bit operations for x = yn. Input is y and n and output is x. Assume all x, y, n are non-negative integer.
For our homework this week we have two problem. The first one reinforces the concepts in chapter 2. The second one deals with concepts from chapter 3. 1. Your solution to this question must conform to the coding rules restrictions shown at the top of page 129. These are as follows. Assumptions Integers are represented in two’s complement form Right shifts of signed data are performed arithmetically Data type int is w bits long. For some problems you will be given a specific value for w, but otherwise your code should work as long as w is a multiple of 8. You can use the expression sizeof(int)<<3 to compute w. Forbidden Conditionals (if or ?:), loops, switch statements, function calls, and macro invocations. Division, modulus, and multiplication. Relative comparison operators ( >, <, <=, and >=) Allowed operations All bit level and logic operations Left and right shifts, but only with shift amounts between 0 and w - 1 Addition and subtraction Equality (==) and…
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.
Please use C++ to solve the listed problems in one code 1). Decrypt the following: “DY CVOOZ ZOBMRKXMO DY NBOKW” 2). Convert 890 to base 9. 3). Determine if the bits of 1100010 is correct or not by using Hamming Code Detection method. If not, detect which bit is incorrect and print out the decimal format of the message that was sent after the correction 4). Universal Set: [A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T] Set A: [A, B, C, E, H, M] Set B: [A, C, E, G, I, K, M, O, Q, S] Set C: [A, B, C, E, G, K, M, Q, S] Please print out: ((A Union B) Intersect C) 5). Present a Truth Table for the following statement: !(A XOR B) NAND (A OR C) Please provide the code and a screenshot of output