Two's complement representations of integers are also used
Chapter 4, Problem 40E(choose chapter or problem)
Two's complement representations of integers are also used to simplify computer arithmetic and are used more commonly than one's complement representations. To represent an integer x with \(-2^{n-1} \leq x \leq 2^{n-1}-1\) for a specified positive integer n, a total of n bits is used. The leftmost bit is used to represent the sign. A \(0\) bit in this position is used for positive integers, and a 1 bit in this position is used for negative integers. just as in one's complement expansions. For a positive integer, the remaining bits are identical to the binary expansion of the integer. For a negative integer, the remaining bits are the bits of the binary expansion of \(2^{n-1}-|x|\). Two's complement expansions of integers are often used by computers because addition and subtraction of integers can be performed easily using these expansions, where these integers can be either positive or negative.
Answer Exercise 34, but this time find the two's complement expansion using bit strings of length six.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer