
Types of representation for signed number:
- Signed magnitude representation
- One’s complement
- Two’s complement
- Excess-M representation
Signed magnitude representation:
In signed magnitude representation, an extra bit is used to represent the sign of the number. This extra bit is called as sign bit.
- The Most Significant Bit (MSB) in the binary number is referred as sign bit.
- In the signed magnitude representation, if the MSB is 0, then it is treated as positive sign and if the MSB is 1, then it is treated as negative sign.
Example:
Consider the decimal number 36 that can be represented as 00100100 and the decimal number -36 can be represented as 10100100.
One’s complement:
The binary numbers can be represented using one’s complement. Here, the value of every binary digit is complemented that is if the value is 1, it becomes 0 and if the value is 0 it becomes 1.
Example:
Consider the binary number 1101; the one’s complement of the given number is 0010.
Two’s complement:
Two’s complement is another way of representing the binary numbers. To implement the two’s complement to the number, the given binary number should be one’s complemented and then add 1 to the result obtained after one’s complement.
Example:
Consider the binary number 1011. First implement the one’s complement to the given binary number. The number becomes 0100. Then add 1 to the resultant obtained after the one’s complement. The result becomes 0101.
Excess-M Representation:
To get the excess-M representation of a given number,
- Add the given number with the M.
- Convert the obtained value to the binary representation.
Example:
To change to excess-7 representation, add the number
Binary value of
Hence, the result of excess-7 representation for

Explanation of Solution
Representing the binary pattern using various formats in the table:
Unsigned Integer | 4-bit binary value | Signed Magnitude | One’s complement | Two’s complement |
Excess-7 |
0 | 0000 | 0 | 0 | 0 | 7 |
1 | 0001 | 1 | 1 | 1 | 8 |
2 | 0010 | 2 | 2 | 2 | 9 |
3 | 0011 | 3 | 3 | 3 | 10 |
4 | 0100 | 4 | 4 | 4 | 11 |
5 | 0101 | 5 | 5 | 5 | 12 |
6 | 0110 | 6 | 6 | 6 | 13 |
7 | 0111 | 7 | 7 | 7 | 14 |
8 | 1000 | -0 | -7 | -8 | 15 |
9 | 1001 | -1 | -6 | -7 | 16 |
10 | 1010 | -2 | -5 | -6 | 17 |
11 | 1011 | -3 | -4 | -5 | 18 |
12 | 1100 | -4 | -3 | -4 | 19 |
13 | 1101 | -5 | -2 | -3 | 20 |
14 | 1110 | -6 | -1 | -2 | 21 |
15 | 1111 | -7 | -0 | -1 | 22 |
Explanation:
First column represent the unsigned integer, and the corresponding 4-bit binary value is represented in the second column.
While representing the singed magnitude, if the Most Significant Bit is “+”, the given number is positive number and if the Most Significant Bit is “-”, the given number is negative number. For example,
While representing one’s complement, in binary number
While representing two’s complement, in binary number
While representing excess-7, the given unsigned integer is added with the decimal number 7. Here, “1” is represented as “7”, “2” as “8”, and so on.
Want to see more full solutions like this?
Chapter 2 Solutions
The Essentials of Computer Organization and Architecture
- using r language Obtain a bootstrap t confidence interval estimate for the correlation statistic in Example 8.2 (law data in bootstrap).arrow_forwardusing r language Compute a jackknife estimate of the bias and the standard error of the correlation statistic in Example 8.2.arrow_forwardusing r languagearrow_forward
- using r languagearrow_forwardThe assignment here is to write an app using a database named CIT321 with a collection named students; we will provide a CSV file of the data. You need to use Vue.js to display 2 pages. You should know that this assignment is similar, all too similar in fact, to the cars4sale2 example in the lecture notes for Vue.js 2. You should study that program first. If you figure out cars4sale2, then program 6 will be extremely straightforward. It is not my intent do drop a ton of new material here in the last few days of class. The database contains 51 documents. The first rows of the CSV file look like this: sid last_name 1 Astaire first_name Humphrey CIT major hrs_attempted gpa_points 10 34 2 Bacall Katharine EET 40 128 3 Bergman Bette EET 42 97 4 Bogart Cary CIT 11 33 5 Brando James WEB 59 183 6 Cagney Marlon CIT 13 40 GPA is calculated as gpa_points divided by hrs_attempted. GPA points would have been arrived at by adding 4 points for each credit hour of A, 3 points for each credit hour of…arrow_forwardI need help to solve the following case, thank youarrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





