EECE 2160 Lecture Notes - Lecture 4: Operand

• School: Northeastern University
• Department: Electrical and Comp Engineering
• Course: EECE 2160
• Professor: Tena Rafael

Document Summary

1 0 1 1 0 1 = 2^0 + 2^2 + 2^3 + 2^5 = 4510. 5 4 3 2 1 0 need to subscript to diferentiate base 10 vs base 2. Range for n-bit numbers [0, (2^n) - 1] 4 bytes 16 bits easy conversion for long binary. 1 1 0 1 0 0 1 1 1 1 1 0 1 0 groups of 4 bits starting from the lowest digits 2^0. 1 0 1 0 1 0 0 the 1 on the end referred to as a carry out . We use the two"s complement representation (or format). Can use arithmetic algorithms on these numbers and it will still work. Range = [-8, 7] = [-2^(n - 1), 2^(n - 1) - 1] Invert the bits of a number (1 0) Bit n - 1 is the sign. If + (0), bits n -2 0 represents magnitude.