Honestly, what does this mean? I'm using 1101 as an example.  1101 is the signed magnitude of 0101. Using the formula (2n - X), I'm getting 10000 and subtracting 0101.  After subtracting, I get 01011, but it is not equaling the same as the 2's complement of 1101. How do I solve this question?

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

Honestly, what does this mean? I'm using 1101 as an example.  1101 is the signed magnitude of 0101. Using the formula (2n - X), I'm getting 10000 and subtracting 0101.  After subtracting, I get 01011, but it is not equaling the same as the 2's complement of 1101. How do I solve this question?

In Section 10.3, the twos complement operation is defined as follows. To find the twos
complement of X, take the Boolean complement of each bit of X, and then add 1.
a. Show that the following is an equivalent definition. For an n-bit integer X, the twos
complement of X is formed by treating X as an unsigned integer and calculating
(2n - X).
Transcribed Image Text:In Section 10.3, the twos complement operation is defined as follows. To find the twos complement of X, take the Boolean complement of each bit of X, and then add 1. a. Show that the following is an equivalent definition. For an n-bit integer X, the twos complement of X is formed by treating X as an unsigned integer and calculating (2n - X).
Expert Solution
Step 1

Let's start by reviewing what signed magnitude and two's complement representations are:

Signed magnitude: In signed magnitude representation, the leftmost bit represents the sign (0 for positive, 1 for negative) and the remaining bits represent the magnitude of the number. For example, 1101 is -5 in signed magnitude because the leftmost bit is 1 indicating a negative number and the remaining bits represent the magnitude, which is 0101 or 5.

Two's complement: In two's complement representation, the leftmost bit still represents the sign, but the remaining bits represent the magnitude of the number in a slightly different way. To find the two's complement of a number, first take the Boolean complement of each bit (i.e., flip all the 0s to 1s and all the 1s to 0s), and then add 1. For example, to find the two's complement of -5 (represented in signed magnitude as 1101), we first take the Boolean complement of each bit to get 0010, and then add 1 to get 0011, which represents +3 in two's complement.

steps

Step by step

Solved in 2 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

What am I doing wrong?

In Section 10.3, the twos complement operation is defined as follows. To find the twos
complement of X, take the Boolean complement of each bit of X, and then add 1.
a. Show that the following is an equivalent definition. For an n-bit integer X, the twos
complement of X is formed by treating X as an unsigned integer and calculating
(2n - X).
Transcribed Image Text:In Section 10.3, the twos complement operation is defined as follows. To find the twos complement of X, take the Boolean complement of each bit of X, and then add 1. a. Show that the following is an equivalent definition. For an n-bit integer X, the twos complement of X is formed by treating X as an unsigned integer and calculating (2n - X).
CAFES CAPTI
0
10.10-
X
11010
10/10
10X
T010
0000
1010=X BUHA
INGEN?
(x-"e)
USING (2n-x)
11:00 - 1611
1=957
se
grisn
MAGNITUDE
10114
034915
↑
-SS
1
101011011
D
☆ QUESTION 1016a
Transcribed Image Text:CAFES CAPTI 0 10.10- X 11010 10/10 10X T010 0000 1010=X BUHA INGEN? (x-"e) USING (2n-x) 11:00 - 1611 1=957 se grisn MAGNITUDE 10114 034915 ↑ -SS 1 101011011 D ☆ QUESTION 1016a
Solution
Bartleby Expert
SEE SOLUTION
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY