Consider a computer with a 16 bit format.
Part a: Represent 99 and -99 in 2's complement format.
Part b: what are the largest(positive) and smallest (negative) integers a word can represent?
Show them in 2's complement form.
Part c: What numbers do the following 3 words represent? 1111 1111 1111 1111, 1000 0000 0000 0001, 0100 0100 0100 0100.
Part d: compute 99+ (-30), 99 +30 and -99 +(-30) in binary arithmetic.
You have to satisfy the requirements and find the largest and smallest integers specific in the instruction.