※ 引述《abbyrfu (abrfu)》之銘言：
: 想請教
: 5.Assume that a computer use 2's complement
: to represent a negative integer.
: Let X and Y are two 8-bit signed integers in computer,
: where X=1111 0010 Y=0001 1011 then X-Y=?
: a 1101 0111 b 1110 1011 c 1011 0111 d 0000 1101 e None of the above.
: (這題我算是 1111 0011,可是解答好像是a?)
: 6.X and Y are two real numbers in IEEE sigle-precision floating-point format:
: X=0 00000010 01000000000000000000000
: Y=0 00000011 00011100000000000000000
: calculate and show the result of X+Y.
: a 0 00000100 11011110000000000000000
: b 0 00000100 10111100000000000000000
: c 0 00000011 10111100000000000000000
: d 0 00000101 01011100000000000000000
: e None of the above
: (這題不知道怎麼算.....QQ)
: 29.Which of the following is valid?
: a {X v Y, X}├Y.
: b {X ^ Y, →Z}├Z
: c {X→Y,Y}├X
: d {X→Y,Y→Z}├Z→X
: e {X v Y,Y ^ Z}├X
: (不懂..........)
: 懇請
: 幫忙解惑O_Q
5.看到這種以2補數做減法運算的題目，一定是先對Y取2補數，又因為減正數等於加負數，所以Y取2補數00011011→11100101，接著再把它與X相加就行了。
X