Unit-1

Computer Data Representation

Prepared by:
Subject:- COA Asst. Prof. S Joshi
Y JOSHI
•Shweta •1
Code:-3140707 (CSE Department,ACET)
 Topics to be covered
• Basic computer data types
• Complements
• Fixed point representation
• Register Transfer and Micro-operations
• Floating point representation
• Register Transfer language
• Register Transfer
• Bus and Memory Transfers
• Arithmetic Micro-Operations
• Logic Micro-Operations
• Shift Micro-Operations
• Arithmetic logical shift unit.
•Shweta Joshi •2
 Basic computer data types
• Binary information in digital computers is stored in memory
or processor registers.
• The data types found in the registers of digital computers may
be classified as being one of the following categories: (1)
numbers used in arithmetic computations, (2) letters of the
alphabet used in data processing, and (3) other discrete
symbols used for specific purposes. All types of data, except
binary numbers, are represented in computer registers in
binary-coded form.
• A number system of base or radix r is a system of that uses
distinct symbols for r digits
• The decimal number system in everyday use employs radix 10
system. The 10 symbols are 0, 1, 2, 3, 4, 5, 6,7, 8, and 9;
highest number being r-1
•Shweta Joshi •3
 Basic computer data types
• The binary number system uses the radix 2. The two digit
symbols used are 0 and 1.
• The string of digits 101101 is interpreted to represent
1 x 25 + 0 x 24 + 1 x 23 + 1 x 22 + 0 x 21 + 1 x 20 = 45
• Besides the decimal and binary number systems,
• Octal (radix 8)- 0,1,2,3,4,5,6,7 and
• Hexadecimal (radix 16) – 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
• Octal can be converted to decimal as follows
(736.4)8
= 7 X 82 + 3 X 81 + 6 X 80 + 4X8-1
= 7X64 + 3X8 + 6X1 + 4/8
= (478.5) 10
•Shweta Joshi •4
 Basic computer data types
• Hexadeciamal can be converted to decimal
(F3)16 = F x 16 + 3
= 15 x 16 + 3
= (243)10

Octal and Hex can be obtained from Binary as shown below:

•Shweta Joshi •5
 Complements
• A binary code is a group of n bits that assume upto 2^n
distinct combinations of 0s and 1s.
• A BCD code is a binary coded decimal i.e. binary coding
decimal numbers.
• ASCII (American Standard Code for Information Interchange),
• which uses seven bits to code 128 characters is standard
alphanumeric character code.
• Complements are used in digital computers for simplifying
the subtraction operation and for logical manipulation. There
are two types of complements
• For each base r system: the r's complement and the (r - 1)'s
complement

•Shweta Joshi •6
 Complements
• For binary base 2 system: the 2's complement and the 1's
complement
• For decimal base 10 system: the 10's complement and the 9's
complement
• The 9's complement of 546700 is
999999 - 546700 = 453299
• The 9's complement of 12389 is
99999 - 12389 = 87610
• The 1's complement of a binary number is formed by
Changing 1's into 0's and 0's into 1's.
• For example, the 1's complement of 1011001 is 0100110 and
the 1's complement of 0001111 is 1110000.

•Shweta Joshi •7
 Complements
• The 10's complement of the decimal 2389 is 7610 + 1 = 7611
and is obtained by adding 1 to the 9's complement value.
• The 2's complement of binary 101100 is 010011 + 1 = 010100
and is obtained by adding 1 to the 1's complement value.
• For example, the 1's complement of 1011001 is 0100110 and
the 1's complement of 0001111 is 1110000.

• Solve:
Find the 9’s and 10’s complement of 246700.

Find the 1’s and 2’s complement of 1101100.

•Shweta Joshi •8
 Fixed-Point Representation
• In computer binary systems it is customary to represent the
sign with a bit placed in the leftmost position of the number.
• sign bit is equal to 0 for positive and to 1 for negative.
• a number may have a binary (or decimal) point.
• There are two ways of specifying the position of the binary
point: by giving it a fixed position or by employing a floating-
point representation.
• The fixed-point method assumes that the binary point is
always. fixed in one position.
• The two positions most widely used are (1) a binary point in
the extreme left of the register to make the stored number a
fraction, and (2) a binary point in the extreme right of the
register to make the stored number an integer. In either case,
the binary point is not actually present.
•Shweta Joshi •9
 Fixed-Point Representation
Integer Representation for signed numbers
• signed-magnitude representation 1 0001110
• signed-1's complement representation 1 1110001
• signed-2's complement representation 1 1110010

•Shweta Joshi •10

 Floating Point Representation
• The floating-point representation uses a second register to
store a number that designates the position of the decimal
point in the first register.
• The floating-point representation of a number has two parts.
The first part represents a signed, fixed-point number called
the mantissa. The second part designates the position of the
decimal (or binary) point and is called the exponent The fixed-
point mantissa may be a fraction or an integer. For example,
• the decimal number +6132.789 is represented in floating-point
with a fraction and an exponent as follows:
Fraction Exponent
+0.6132789 +04

•Shweta Joshi •11

 Floating Point Representation
• A floating-point binary number is represented in a similar
manner except that it uses base 2 for the exponent.

• For example, the binary number +1001.11 is represented with

an 8-bit fraction and 6-bit exponent as follows:

Fraction Exponent
01001110 000100

•Shweta Joshi •12

 Some other codes
• Gray Codes
• BCD 8421
• 2421
• Excess 3 codes
• Other alphanumeric codes like EBCDIC (Extended BCD
Interchange Code)
• Error detecting/ Correcting codes-Parity
• Even parity odd parity

•Shweta Joshi •13

 Register Transfer language
• A digital system is an interconnection of digital hardware
modules that accomplish a specific information-processing
task.
• The modules are constructed from registers, decoders,
arithmetic elements, and control logic
• Digital modules are best defined by the registers they contain
and the operations that are performed on the data stored in
them.
• The operations executed on data stored in registers are called
micro-operations.
• A micro-operation is an elementary operation performed on
the information stored in one or more registers.

•Shweta Joshi •14

 Register Transfer language
• The symbolic notation used to describe the micro-operation
transfers among registers is called a register transfer
language.
• The term "register transfer" implies the availability of
hardware logic circuits that can perform a stated micro-
operation and transfer the result of the operation to the same
or another register.
• Computer registers are designated by capital letters
sometimes followed by numerals) to denote the function of
the register.
• MAR Memory Address Register
• PC Program Counter

•Shweta Joshi •15

 Register Transfer language
• Register Transfer
R2  R1
• denotes a transfer of the content of register R1 into register R2.
• In RTL, To show an if condition
• (where P is a control signal generated in the control section)
If (P = 1) then (R2  R1)
Can be shown in RTL as
P : R2  R1
• Generally a comma is used to separate two or more operations
executed at the same time
• T : R2  R1 , R1  R2

•Shweta Joshi •16

 Bus Transfers
• Common Bus System is a scheme for transferring information
between registers in a multiple register configuration.

A bus structure
consists of
common lines,
can be
constructed with
the help of
multiplexers
•Shweta Joshi •17
Bus Transfers
• A bus system can also be
constructed with three-state
gates. A three-state gate is a
digital circuit that exhibits
three states. Two of the states
are signals equivalent to logic
1 and 0 as in a conventional
gate. The third state is a high-
impedance state. The high-
impedance state behaves like
an open circuit, which means
that the output is
disconnected and does not
have a logic significance.

•Shweta Joshi •18

 Memory Transfers
• The transfer of information from a memory word to the
outside environment is called a read operation.
• The transfer of new information to be stored into the memory
is called a write operation.
• A memory word will be symbolized by the letter M.
• Consider a memory unit that receives the address from a
register, called the address register, symbolized by AR. The
data are transferred to another register, called the data
register, symbolized by DR.
• The read operation can be stated as follows:
Read: DR <- M[AR]
• This causes a transfer of information into DR from the
memory word M selected by the address in AR
•Shweta Joshi •19
 Arithmetic Micro-Operations
• Arithmetic micro operations specify the addition subtraction or
complementing of the string of bits stored in registers.

• Some of them are :

R3  R1 + R2 Contents of R1 plus R2 transferred to R3
R3  R1 - R2 Contents of R1 minus R2 transferred to R3
R2  R2’ Complement the contents of R2 (1's)
R2  R2’ + 1 2's complement the contents of R2 (negate)
R3  R1 + R2’ + 1 R1 plus the 2's complement of R2(subtraction)
R1  R1 + 1 Increment the contents of R1 by one
R1  R1 – 1 Decrement the contents of R1 by one

•Shweta Joshi •20

 Logic Micro-Operations
• Logic micro operations specify binary operations for strings of
bits stored in registers. There are 16 different logic operations
that can be performed with two binary variables.

•Shweta Joshi •21

 Shift Micro-Operations
• Shift micro operations are used for serial transfer of data
• also used with arithmetic, logic, and other data-processing
operations.

Symbolic designation Description

R  shl R Shift-left register R
R  shr R Shift-right register R
R  cil R Circular shift-left register R
R  cir R Circular shift-right register R
R  ashl R Arithmetic shift-left R
R  ashr R Arithmetic shift-right R

•Shweta Joshi •22

 Arithmetic Logic Shift Unit
• Computer systems
employ a number
of storage
registers
connected to a
common
operational unit
called an
arithmetic logic
unit, abbreviated
ALU.

•Shweta Joshi •23

 Arithmetic Logic Shift Unit
• Table lists
the 14
operations
of the ALU.
• The first 8
are
arithmetic
and next
four logic,
last two
are shift

•Shweta Joshi •24

 References
• Images , descriptive Tables , from Computer System Architecture, Morris
Mano, 3rd edition Prentice Hall

• Note: These pdf/ppt notes are for purpose of teaching aids to

classroom/online sessions study, and in no case imply for GTU syllabus or
GTU exam. For GTU syllabus or exam related preparation, one may, however
will need to attend college/online lectures and refer books given by GTU in
their official syllabus.

•Shweta Joshi •25