1. Questions 1a through 1c are about a computer that represents integers in 16-bit, two's complement form.
a. How would the computer represent the integer 7734? Your answer must be a binary (base 2) number, without a sign.
b. How would the computer represent the integer -7734? Your answer must be a binary (base 2) number, without a sign.
c. Can the computer represent a non-zero integer n such that n = - n? If it can, then show that number in decimal (base 10) form. If it cannot, then explain why not.
2. Suppose that a large integer k is represented in two's complement form. It may be negative, zero, or positive. We say that k is even if and only if |k| mod 2 = 0. How can we quickly test if k is even without using arithmetic operations, and without using mod?