Suppose an 8-bit data word stored in memory is 1010111. Using the Hamming algorithm, determine what check bits would be stored in memory with the data word. Show how you got your answer.

How do the unsigned binary representations differ (ignoring the underscores)?

1 a. If the last operation performed on a computer with an 8-bit word was an addition in which the two operands were 00000010 and 00000011, what would be the value of the following flags? ● Carry • Zero • Overflow Sign • Even Parity ● Half-Carry b. Repeat for the addition of -1 (twos complement) and +1.

H - For the IEEE 754 single-precision floating point, write the hexadecimal representation for the following decimal values: (i)–1.0 (ii)– 0.0 (iii)256.015625

Using the Hamming code given in classfor 8 bit data words, determine whether there is an error, and if so, in which bit, for each of the following words fetched from memory: A.0010 0011 0010 B.0110 0011 1010

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).

What is the largest unsigned integer that fits in a 4-bit word? Show how you determine it. What is the largest unsigned integer that fits in an 8-bit word? Show how you determine it.

Multiply the binary values shown using Booth's Algorithm, listing each step along the way.

Floating-Point Representation. What is the floating-point value for binary 4. a) 11000010100000 using the simple model (14-bit format, 5 bits for the exponent with a bias 15, a normalized significand of 8 bits, and a single sign bit for the number)?

Given this place-weighting, or Horner's Algorithm, convert the following eight-bit two's complement binary numbers, i.e. signed arithmetic, into decimal form: (show work) I a. 010101012 c. 11000000₂ e. 01010101₂ b. 01110010₂ 110101112 f. 011001012