Suppose we truncate a 4-bit value (represented by hex digits 0 through F) to a 3 bit

Question:

Suppose we truncate a 4-bit value (represented by hex digits 0 through F) to a 3 bit value (represented as hex digits 0 through 7.) Fill in the table below showing the effect of this truncation for some cases, in terms of the unsigned and two's complement interpretations of those bit patterns.

Original 1 3 5  E Hex Truncated 1 3 5 4 6 Unsigned Original 1 3 5 12 14 Truncated Two's complement Original

Explain how Equations 2.9 and 2.10 apply to these cases.

Eq. 2.9

B2Uk([X-1, k-2, ..., xo) = B2Uw ([xw-1, Xw-2, ..., xo) mod 2* (2.9)

Eq. 2.10

B2Tk([Xk-1 Xk-2, xo) = U2T (B2Uw ([Xw-1, Xw-2, ..., xo)) mod 2k) (2.10)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  answer-question

Computer Systems A Programmers Perspective

ISBN: 9781292101767

3rd Global Edition

Authors: Randal E. Bryant, David R. O'Hallaron

Question Posted: