Binary Representation of Integers

-

Binary Representation of Integers


Binary number can be represented only by using 0’s and 1’s, but cannot use the sign (-) to denote the negative number or sign (+) to denote the positive number. So, it must be either 0 or 1. There are three methods to represent binary number. They are
      1.     Sign and magnitude method
      2.    One’s complement method
     3.    Two’s complement method

·       Sign and magnitude method
In this method, first bit is considered as a sign bit. Here positive number starts with 0 and negative number starts with 1.
Example:            25

25/2 = 12    1
12/2 = 6      0
6/2 = 3        0
3/2 = 1        1
1/2 = 0        1
So the binary number is (11001)2. If we take the size of the word is 1 byte, then the number 25 will be represented as 00011001.
Suppose, if the number is -25, and then it will be represented as 10011001.

·       One’s Complement Method
In this method, the positive number is represented as same as the binary number. If the number is negative, then we need to find one’s complement of a binary number. The one’s complement of a binary number will replace every 0 with 1 and vice- versa.
Example
(i)                          Represent 86 in one’s complement method (1 byte representation)
86/2 =43  0
43/2 =21  1
21/2 =10  1
10/2 =5    0
5/2 =2      1
2/2 =1      0
1/2 =0      1
The binary number is 1010110
1 byte representation of number 86 is 01010110

(ii)                        Represent -55 in one’s complement method (1 byte representation)
55/2 =27  1
27/2 =13  1
13/2 =6    1
6/2 =3      0
3/2 =1      1
1/2 =0      1
The binary number is 110111
1 byte representation is 00110111
The given number is negative; hence we need to calculate one’s complement
One’s complement of 00110111 is 11001000 (convert 1 into 0 and 0 into 1)
Thus, the 1 byte representation of number -55 is 11001000.

·       Two’s Complement method
In this method, the positive number is represented as the binary number. If the number is negative, then we need to calculate two’s complement of a binary number. The two’s complement of a binary number is calculated by adding 1 to its one’s complement.
Example
(i) Represent 87 in two’s complement method (1 byte representation)
87/2 =43 1
43/2 =21 1
21/2 =10 1
10/2 =5   0
5/2 =2     1
2/2 =1     0
1/2 =0     1
The binary number is 1010111
Hence, the 1 byte representation of number 86 is 01010111

(ii) Represent -54 two’s complement method (1 byte representation)
54/2 =27 0
27/2 =13 1
13/2 =6   1
6/2 =3     0
3/2 =1     1
1/2 =0     1
The binary number is 110110
Hence, the 1 byte representation is 00110110
The given number is negative; hence we need to calculate two’s complement.
One’s complement of 00110110 is 11001001 (convert 1 into 0 and 0 into 1)

Add 1 to one’s complement
               1
11001001 (1+1=2, binary equivalent =10)
+               1
11001010
Thus, 1 byte representation of number -54 is 11001010

Comments

Post a Comment

Popular posts from this blog

ASCII / ISCII / UNICODE

-
Image
     Internal storage of encoding characters   A computer is capable of handling numeric data but in addition to numerical data, a          computer must be able to handle non-numerical information . In other words, a              computer should recognize codes that represent letters of the alphabet,                            punctuation and other special characters as well as numbers. These codes are            called alphanumeric codes. 1.      ASCII (American Standards Code for Information Interchange) ASCII code is most widely used alphanumeric code used in computers. It is used extensively in small computers, peripherals, instruments and communication devices. ASCII-7 can represent 2 7 =128 characters. ASCII-8 can represent 2 8 =256 characters. It is an extended form ASCII-7. ASCII code is used for the transfer of alphanumeric information between a computer and I/O devices. A computer uses this code to internally store the information that an op
Read more

CISC / RISC / EPIC

-
Classification of Microprocessors 1.     CISC Processors: CISC is known as Complex Instruction Set Computer . The CISC approach attempts to minimize the number of instructions per program, sacrificing the number of cycles per instruction. Computers based on the CISC architecture are designed to decrease the memory cost . The number of instructions per program can be reduced by embedding the number of operations in a single instruction, thereby making the instructions more complex. For example, MUL(Multiply) . It performs operations such as load from memory, an arithmetic operation and a memory store all in single instruction. Example: IBM 370/168, Intel 80486 etc. Advantages: a.      Microprogramming is as easy as assembly language to implement and much less expensive than hardwiring a control circuit. b.      Fewer instructions are needed to implement a particular computing task, which led to lower memory use for program storage and fewer time consuming inst
Read more

Evolution of Computers

-
Image
Evolution of Computers The growth of computer industry started with the need for performing fast calculations. The manual method of computing was slow and prone to errors. So attempts were made to develop faster calculating devices. The journey that started from the first calculating device i.e. Abacus has led us today to extremely high speed calculating devices. Let us first have a look at some early calculating devices and then we will explore various generations of computer. Abacus Abacus was discovered by the Mesopotamia’s in around 3000 BC. An abacus consisted of beads on movable rods divided into two parts. (Fig-1) Addition and multiplication of numbers was done by using the place value of digits of the numbers and position of beads in an abacus. Fig. Abacus The Chinese further improved on the abacus so that calculations could be done more easily. Even today abacus is considered as an apt tool for young children to do calculations. In an abacus, each row is thought o
Read more