Computer Organization and Architecture (COA) Chapter - 1 Introduction of Computer
Computer Organization and Architecture (COA) Chapter - 1 Introduction of Computer
Computer Organization and Architecture (COA) Chapter - 1 Introduction of Computer
Chapter -1
Introduction of computer
In today's world, we use computers for all our tasks. Our day-to-
day activities: paying bills, buying groceries, using social media,
seeking entertainment, working from home, communicating with a
friend, etc., can all be done using a computer. So it is important not
only to know how to use a computer, but also to understand the
components of a computer and what they do.
What is a Computer?
A computer is an electronic device that accepts data from the user,
processes it, produces results, displays them to the users, and
stores the results for future usage.
Data - is a collection of unorganized facts & figures and does not
provide any further information regarding patterns, context, etc.
Hence data means "unstructured facts and figures".
Information - is a structured data i.e. organized meaningful and
processed data. To process the data and convert into information, a
computer is used.
Functions of Computers
Receiving Input
Producing output
Computer
Organization and
Architecture Tutorial
ADVERTISEMENT
ADVERTISEMENT
What is Computer
Architecture and
Organization?
ADVERTISEMENT
Von-Neumann Model
Von-Neumann proposed his computer
architecture design in 1945 which was later
known as Von-Neumann Architecture. It
consisted of a Control Unit, Arithmetic, and
Logical Memory Unit (ALU), Registers and
Inputs/Outputs.
A Von Neumann-based
computer:
ADVERTISEMENT
ADVERTISEMENT
Components of Von-
Neumann Model:
ADVERTISEMENT
ADVERTISEMENT
o Buses
o Memory Unit
ADVERTISEMENT
ADVERTISEMENT
Control Unit
ADVERTISEMENT
ADVERTISEMENT
Registers
ADVERTISEMENT
ADVERTISEMENT
Registers Description
Buses
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
Bus Description
Memory Unit
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
2. Motherboard
5. Power supply
6. Cooling fan
7. Hard drive
8. Monitor
9. Printer
10. Scanner
Casing
Chipset
Port Data
Function
Type Direction
Output
Input &
RJ-11 Telecommunications
Output
Input &
Serial Send one bit of data at a time
Output
Input &
Parallel High bandwidth transfer
Output
Input &
USB Transfer data and power
Output
Chapter -2 Data Representation
Data Representation
Data
Digitization
Binary Digits
Uses
Binary Numbers
Representation
ADVERTISEMENT
ADVERTISEMENT
Our computer can understand only (0, 1)
language. The binary numbers are
represented in both ways, i.e., signed and
unsigned. The positive numbers are
represented in both ways- signed and
unsigned, but the negative numbers can only
be described in a signed way. The difference
between unsigned and signed numbers is
that unsigned numbers do not use any sign
bit for positive and negative numbers
identification, but the signed number used.
Unsigned Numbers
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
102 102/2 51 0
51 51/2 25 1
25 25/2 12 1
12 12/2 6 0
6 6/2 3 0
3 3/2 1 1
1 1/2 0 1
ADVERTISEMENT
ADVERTISEMENT
Signed Numbers
ADVERTISEMENT
ADVERTISEMENT
1. Sign-Magnitude form
In this form, a binary number has a bit for
a sign symbol. If this bit is set to 1, the
number will be negative else the number
will be positive if it is set to 0. Apart from
this sign-bit, the n-1 bits represent the
magnitude of the number.
2. 1's Complement
By inverting each bit of a number, we can
obtain the 1's complement of a number.
The negative numbers can be represented
in the form of 1's complement. In this
form, the binary number also has an extra
bit for sign representation as a sign-
magnitude form.
3. 2's Complement
By inverting each bit of a number and
adding plus 1 to its least significant bit, we
can obtain the 2's complement of a
number. The negative numbers can also be
represented in the form of 2's
complement. In this form, the binary
number also has an extra bit for sign
representation as a sign-magnitude form.
ADVERTISEMENT
ADVERTISEMENT
Floating-Point Representation
X=(x0*20+x1*21+x2*22±−−∓b−(n−1)*2−(n−1) )
Mantissa*2Exponent
BCD
0 0000
1 0001
2 0010
3 0011
4 0100
5 0101
6 0110
7 0111
8 1000
9 1001
For example:
1 -> 0001
2 -> 0010
3 -> 0011
3 -> 0011
2 -> 0010
4 -> 0100
Stack organization
Types of Instructions
Based on the number of addresses,
instructions are classified as:
NOTE: We will use the X = (A+B)*(C+D)
expression to showcase the procedure.
PUSH A TOP = A
PUSH B TOP = B
ADD TOP = A+B
PUSH C TOP = C
PUSH D TOP = D
ADD TOP = C+D
MUL TOP = (C+D)*(A+B)
POP X M[X] = TOP
One Address Instructions
LOAD A AC = M[A]
ADD B AC = AC + M[B]
STORE T M[T] = AC
LOAD C AC = M[C]
ADD D AC = AC + M[D]
MUL T AC = AC * M[T]
STORE X M[X] = AC
Two Address Instructions
A set of instructions is
said to be complete if the
computer includes a
sufficient number of
instructions in each of the
following categories:
Instructions which
controls the program
together with instructions
that check status
conditions.
Program control
instructions such as
branch instructions are
used change the
sequence in which the
program is executed.
Instruction Cycle
A program residing in the memory unit of a
computer consists of a sequence of
instructions. These instructions are executed
by the processor by going through a cycle for
each instruction.