Unit1 COA
Unit1 COA
Noida
(An Autonomous Institute)
School of Computer Science & Engineering in Emerging
Technologies
Introduction
Unit: 1
Professional details:
• Name of Institute with Code: NIET(133)
• Designation: Assistant Professor
• Department: ECE
Other applications
• These relate to the skills, knowledge, and behavior that students acquire
through the programmed.
1. Engineering knowledge
2. Problem analysis 9. Individual and team work
3. Design/development of solutions 10. Communication
4. Conduct investigations of complex 11. Project management and
problems finance
5. Modern tool usage 12. Life-long learning
6. The engineer and society
7. Environment and sustainability
8. Ethics
COMPUTER ORGANIZATION AND ARCHITECTURE
(ACSE 0305)
PO PO PO
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 10 11 12
CO1 3 2 1 1 1 1 1 - 1 1 1 2
CO2 2 2 2 2 1 1 - 1 1 1 1 2
CO3 3 2 2 1 2 2 1 1 2 2 1 2
CO4 3 2 2 2 2 1 1 - 1 1 1 2
CO5 2 2 2 1 2 - 1 - 1 2 2 2
Average 2.6 2 1.8 1.4 1.6 1 0.8 0.4 1.2 1.4 1.2 2
Computer 100%
Organization
and Architecture
Renewable 98.57%
Energy
Resources
Universal 90.74%
Human Values
Introduction to 95.61%
Microprocessor
Question Paper
Template -100 Marks
The COA important topics include all the fundamental concepts such
as computer system functional units , processor micro architecture ,
program instructions, instruction formats , addressing modes ,
instruction pipelining, memory organization , instruction cycle,
interrupts and other important related topics.
• Introduction
• Functional units of digital system and their interconnections
• Buses, bus architecture, Types of buses
• Bus arbitration
• Register, bus and memory transfer.
• Processor organization
• General registers organization
• Stack organization
• Addressing modes
Block Diagram
4. Control Unit :
• It coordinates and controls the data flow in and out of CPU and also
controls all the operations of ALU, memory registers and
input/output units.
• It decodes the fetched instruction, interprets it and sends control
signals to input/output devices until the required operation is done
properly by ALU and memory.
Swarnima Computer Organisation & Architecture Unit 1
11/19/2022 22
Functional Units of Computer System
5. Memory :
• Memory attached to the CPU is used for storage of data and
instructions and is called internal memory.
• The internal memory is divided into many storage locations, each of
which can store data or instructions
6. Output Unit :
• The output unit consists of output devices that are attached with
the computer.
• It converts the binary data coming from CPU to human
understandable form.
• The common output devices are monitor, printer, plotter etc.
BUS
• A bus is a common pathway through which information flows from
one computer component to another.
• It is a subsystem that is used to transfer data and other information
between devices.
• Means various devices in computer like(Memory, CPU, I/O and
Other) are communicate with each other through buses.
2. Address bus
• Address Lines are collectively called as address bus.
• It is a unidirectional pathway that allows information to travel in
only one direction.
• No. of lines in address are usually 16,20,24, or more depending on
type and architecture of bus
• It is an internal channel from CPU to Memory across which the
address of data(not data) are transmitted.
• It is used to identify the source or destination of data.
• Here the communication is one way that is, the address is send
from CPU to Memory and I/O Port but not Memory and I/O port
send address to CPU on that line and hence these lines are
unidirectional.
3. Control bus
• It carries the control and timing signals needed to coordinate the
activities of the entire computer.
• They are used by CPUs for Communicating with other devices
within the computer.
• They are bidirectional.
• Typical Control Lines signals are
Memory Read
Memory Write
I/O Read
I/O Write ,etc
2. Polling method
Advantages –
1. Simplicity and Scalability.
2. The user can add more devices anywhere along the chain
Disadvantages –
3. The value of priority assigned to a device is depends on the
position of master bus.
4. Propagation delay is arises in this method.
5. If one device fails then entire system will stop working.
Advantages –
1. This method does not favor any particular device and
processor.
2. The method is also quite simple.
3. If one device fails then entire system will not stop working.
Disadvantages –
4. Adding bus masters is difficult as increases the number of
address lines of the circuit.
Disadvantages –
•Hardware cost is high as large no. of control lines are required.
Register Transfer
• Information transfer from one register to another is designated in
symbolic form by means of a replacement operator.
• R2 R1
• It denotes a transfer of the content of register R1 into register R2. It
designates a replacement of the content of R2 by the content of R1
without changing the content of R1 after transfer.
• If the Register transfer is to occur only under a predetermined control
condition, this can be shown by means of an if-then statement.
Bus transfer
• A bus structure consists of a set of common lines, one for each bit of
a register.
• Control signals determine which register is selected by the bus during
each transfer.
• Multiplexers can be used to construct a common bus.
• Multiplexers select the source register whose binary information is
then placed on the bus.
• The select lines are connected to the selection inputs of the
multiplexers and choose the bits of one register
• The three-state buffer gate has a normal input and a control input
which determines the output state.
• With control 1, the output equals the normal input
• With control 0, the gate goes to a high-impedance state
• This enables a large number of three-state gate outputs to be
connected with wires to form a common bus line without endangering
loading effects
• Decoders are used to ensure that no more than one control input is
active at any given time
• This circuit can replace the multiplexer.
• To construct a common bus for four registers of n bits each using
three-state buffers, we need n circuits with four buffers in each
• Only one decoder is necessary to select between the four registers
Registers
• where X is the address of the operand. The ADD instruction in this case
results in the operation AC <--AC + M[X].
• AC is the accumulator register and M[X] symbolizes the memory word
located at address X.
• ADD
This instruction in stack computer consists of an operation code only
with no address field.
For example:
• MULT R1, R2, R3
• This is an instruction of an arithmetic multiplication written in assembly
language. It uses three address fields R1, R2 and R3.
• This instruction also can be written using only two address fields as:
MULT R1, R2
001 R1 R1 R1
010 R2 R2 R2
011 R3 R3 R3
100 R4 R4 R4
101 R5 R5 R5
110 R6 R6 R6
111 R7 R7 R7
Subtract microoperation:
R1 ----- R2 – R3
• The control unit that operates the CPU bus system directs the
information flow through the registers and ALU by selecting the
various components in the system. For example, to perform the
operation
• R1 <--R2 + R3. The control must provide binary selection variables to
the following selector inputs:
1. MUX A selector (SELA): to place the content of R2 into bus A .
2. MUX B selector (SELB): to place the content o f R 3 into bus B .
3. ALU operation selector (OPR): to provide the arithmetic addition
A+B.
• Decoder destination selector (SELD): to transfer the content of the
output bus into R 1 .
• Less memory space is used to store the program since the instructions
are written in compact way.
• Since large number of registers are used, thus extra cost is required in
this organization.
Swarnima Computer Organisation & Architecture Unit 1
11/19/2022 96
Stack Organization
• A stack is a storage device that stores information in such a manner
that the item stored last is the first item retrieved.
• The stack in digital computers is essentially a memory unit with an
address register that can count only. The register that holds the
address for the stack is called a stack pointer (SP) because its value
always points at the top item in the stack.
• The physical registers of a stack are always available for reading or
writing. It is the content of the word that is inserted or deleted.
Register stack:
PUSH:
• If the stack is not full (FULL =0), a new item is inserted with a push
operation. The push operation consists of the following sequences of
micro operations:
POP:
• A new item is deleted from the stack if the stack is not empty (if
EMTY = 0). The pop operation consists of the following sequences of
micro operations:
Memory Stack
• The stack pointer SP points at the top of the stack which is used to push
or pop items into or from the stack.
• The three registers are connected to a common address bus, and either
one can provide an address for memory.
PUSH
• A new item is inserted with the push operation as follows:
SP ← SP - 1
M[SP] ← DR
• The stack pointer is decremented so that it points at the address
of the next word.
• A memory write operation inserts the word from DR into the top
of the stack.
POP
• A new item is deleted with a pop operation as follows:
DR ← M[SP]
SP ← SP + 1
A + B Infix notation
+AB Prefix or Polish notation
AB+ Postfix or reverse Polish notation (RPN)
2. Immediate mode:
• The operands value are specified in the instruction.
• Immediate mode instructions is said to be useful for initializing registers
to a constant value.
• MOV AL, 35 H
3. Register mode:
• The operands are in registers and the register is present in CPU.
• The data is in the register that is specified by the instruction.
• MOV A,C (move the content of C register to A register)
5. Autoincrement/Autodecrement mode:
• This is similar to register indirect mode except that the register is
incremented or decremented after or before its value is used to access
memory.
a) Increment mode- After accessing the operand the contents of this
register are automatically incremented to point to next consecutive
memory location.
b) Decrement Mode:
• Before accessing the operand , the contents of this register are
automatically decremented to point to the previous consecutive memory
location.
Example- Add R1, (-R2)
OR
R2 = R2 – d
R1 = R1Swarnima
+ M [R2] Computer Organisation & Architecture Unit 1
11/19/2022 111
Addressing Modes
6. Direct Address mode:
• In this mode the effective address is equal to the address part of the
instruction.
• The operand resides in memory and its address is given directly by the
address field of the instruction.
• Example – ADD AL, [0301] (add the content of address 0301 to A)
7. To resolve the clash over the access of the system BUS we use ______
a. Multiple BUS
b. BUS arbitrator
c. Priority access
d. None of the mentioned
8. The device which is allowed to initiate data transfers on the BUS at any
time is called _____
a. BUS master
b. Processor
c. BUS arbitrator
d. Controller
a) A*B+C*D+E*F
b) A* (B+C*CD+E)/F*(G+H)
9. If two devices A and B contesting for the BUS have ID’s 5 and 6
respectively, which device gets the BUS based on the Distributed
arbitration.
a) Device A b) Device B
c) Insufficient information d) None of the mentioned
Sessional 1
Sessional 2
Sessional 3
2018-19
2019-20